Skip to main content
Log in

A penalty derivative-free algorithm for nonlinear constrained optimization

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

In this paper, we modify a derivative-free line search algorithm (DFL) proposed in the Ref. (Liuzzi et al. SIAM J Optimiz 20(5):2614–2635, 2010) to minimize a continuously differentiable function of box constrained variables or unconstrained variables with nonlinear constraints. The first-order derivatives of the objective function and of the constraints are assumed to be neither calculated nor explicitly approximated. Different line-searches are used for box-constrained variables and unconstrained variables. Accordingly the convergence to stationary points is proved. The computational behavior of the method has been evaluated on a set of test problems. The performance and data profiles are used to compare with DFL.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2

Similar content being viewed by others

References

  1. Conn, A.R., Scheinberg, K., Toint, PhL: Recent progress in unconstrained nonlinear optimization without derivatives. Math. Program. 79, 397–414 (1997)

    MathSciNet  MATH  Google Scholar 

  2. Lucidi, S., Sciandrone, M.: A derivative-free algorithm for bound constrained optimization. Comput. Optim. Appl. 21, 119–142 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  3. Liuzzi, G., Lucidi, S., Sciandrone, M.: A derivative-free algorithm for linearly constrained finite minimax problems. SIAM J. Optimiz. 16(4), 1054–1075 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  4. Liuzzi, G., Lucidi, S., Sciandrone, M.: Sequential penalty derivative-free methods for nonlinear constrained optimization. SIAM J. Optimiz. 20(5), 2614–2635 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  5. Liuzzi, G., Lucidi, S., Rinaldi, F.: Derivative-free methods for bound constrained mixed-integer optimization. Comput. Optim. Appl. 53(2), 505–526 (2012)

    Article  MathSciNet  Google Scholar 

  6. Hock, W., Schittkowski, K.: Test examples for nonlinear programming codes. Lecture notes in economics and mathematical systems vol. 187, pp. 26–122. Springer, Berlin (1981)

  7. Schittkowski, K.: More test examples for nonlinear programming Codes. Lecture notes in economics and mathematical systems vol. 282, pp. 40–213. Springer, Berlin (1987)

  8. Mor’e, J.J., Wild, S.M.: Benchmarking derivative-free optimization algorithms. SIAM J. Optimiz. 20, 172–191 (2009)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgments

This work was supported by the National Natural Science Foundation of China under Grant No. 11101262,11171050,U1232112, Dalian University of Technology Special Fund under Grant No. DUTTX2011106, Key Disciplines of Shanghai Municipality under Grant No. S30104, and a Grant of ’The First-class Discipline of Universities in Shanghai’.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wei Lv.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lv, W., Sun, Q., Lin, H. et al. A penalty derivative-free algorithm for nonlinear constrained optimization. Optim Lett 9, 1213–1229 (2015). https://doi.org/10.1007/s11590-014-0832-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-014-0832-9

Keywords

Navigation