Journal of Systems Science and Complexity

, Volume 27, Issue 3, pp 537–564 | Cite as

An affine scaling derivative-free trust region method with interior backtracking technique for bounded-constrained nonlinear programming

  • Jing GaoEmail author
  • Detong Zhu


This paper proposes an affine scaling derivative-free trust region method with interior backtracking technique for bounded-constrained nonlinear programming. This method is designed to get a stationary point for such a problem with polynomial interpolation models instead of the objective function in trust region subproblem. Combined with both trust region strategy and line search technique, at each iteration, the affine scaling derivative-free trust region subproblem generates a backtracking direction in order to obtain a new accepted interior feasible step. Global convergence and fast local convergence properties are established under some reasonable conditions. Some numerical results are also given to show the effectiveness of the proposed algorithm.

Key words

Affine scaling backtracking technique box constrains derivative-free optimization nonlinear programming trust region method. 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Liuzzi G, Lucidi S, and Sciandrone M, A derivative-free algorithm for linearly constrained finite minimax problems, SIAM J. Optim., 2006, 16: 1054–1075.CrossRefzbMATHMathSciNetGoogle Scholar
  2. [2]
    Conn A R, Scheinberg K, and Vicente L N, Global convergence of general derivative-free trustregion algorithms to first- and second-order critical points, SIAM J. Optim., 2009, 20: 387–415.CrossRefzbMATHMathSciNetGoogle Scholar
  3. [3]
    Liuzzi G, Lucidi S, and Sciandrone M, Sequential penalty derivative-free methods for nonlinear constrained optimization, SIAM J. Optim., 2010, 20: 2614–2635.CrossRefzbMATHMathSciNetGoogle Scholar
  4. [4]
    Zhang H, Conn A R, and Scheinberg K, A derivative-free algorithm for least-squares minimization, SIAM J. Optim., 2010, 20: 3555–3576.CrossRefzbMATHMathSciNetGoogle Scholar
  5. [5]
    Zhang H and Conn A R, On the local convergence of a derivative-free algorithm for least-squares minimization, Comput. Optim. Appl., 2012, 51: 481–507.CrossRefzbMATHMathSciNetGoogle Scholar
  6. [6]
    Powell M J and Yuan Y, A trust region algorithm for equality constrained optimization, Math. Program., 1990, 49: 189–211.CrossRefzbMATHMathSciNetGoogle Scholar
  7. [7]
    Zhu D, Curvilinear paths and trust region methods with nonmonotonic back tracking technique for unconstrained optimization, J. Comput. Math., 2001, 19: 241–258.zbMATHMathSciNetGoogle Scholar
  8. [8]
    Jia C and Zhu D, A trust region interior point algorithm for solving bound-constrained nonlinear systems, Journal of Shanghai Normal University, 2005, 34: 1–7.Google Scholar
  9. [9]
    Apostolopoulou M S, Sotiropoulos D G, and Pintelas P, Solving the quadratic trust-region subproblem in a low-memory BFGS framework, Optim. Methods Softw., 2008, 23: 651–674.CrossRefzbMATHMathSciNetGoogle Scholar
  10. [10]
    Coleman T F and Li Y, An interior trust region approach for nonlinear minimization subject to bounds, SIAM J. Optim., 1996, 6: 418–445.CrossRefzbMATHMathSciNetGoogle Scholar
  11. [11]
    Heinkenschloss M, Ulbrich M, and Ulbrich S, Superlinear and quadratic convergence of affinescaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption, Math. Program., 1999, 86: 615–635.CrossRefzbMATHMathSciNetGoogle Scholar
  12. [12]
    Coleman T F and Li Y, A trust region and affine scaling interior point method for nonconvex minimization with linear inequality constraints, Math. Program., 2000, 88: 1–31.CrossRefzbMATHMathSciNetGoogle Scholar
  13. [13]
    Zhu D, A new affine scaling interior point algorithm for nonlinear optimization subject to linear equality and inequality constraints, J. Comput. Appl. Math., 2003, 161: 1–25.CrossRefzbMATHMathSciNetGoogle Scholar
  14. [14]
    Zhu D, An affine scaling interior trust-region method for LC 1 minimization subject to bounds on variables, Appl. Math. Comput., 2006, 172: 1272–1302.CrossRefzbMATHMathSciNetGoogle Scholar
  15. [15]
    Kanzow C and Klug A, On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints, Comput. Optim. Appl., 2006, 35: 177–197.CrossRefzbMATHMathSciNetGoogle Scholar
  16. [16]
    Kanzow C and Klug A, An interior-point affine-scaling trust-region method for semismooth equations with box constraints, Comput. Optim. Appl., 2007, 37: 329–353.CrossRefzbMATHMathSciNetGoogle Scholar
  17. [17]
    Conn A R, Scheinberg K, and Vicente L N, Introduction to Derivative-Free Optimization, Society for Industrial and Applied Mathematics, Mathematical Programming Society, Philadelphia, PA, 2009.CrossRefzbMATHGoogle Scholar
  18. [18]
    Schittkowski K, More Test Examples for Nonlinear Programming Codes, Springer-Verlag, Berlin, 1987.CrossRefzbMATHGoogle Scholar
  19. [19]
    Floudas C A, et al., Handbook of Test Problems in Local and Global Optimization, Kluwer Academic Publishers, Dordrecht, 1999.CrossRefzbMATHGoogle Scholar
  20. [20]
    Gould N I M, Orban D, and Toint P L, CUTEr, a constrained and unconstrained testing environment (revisited), ACM Trans. Math. Softw., 2003, 29: 373–394.CrossRefzbMATHMathSciNetGoogle Scholar
  21. [21]
    Powell M J D, The BOBYQA algorithm for bound constrained optimization without derivatives, Technical Report, 2009, 6: 1–39.Google Scholar
  22. [22]
    Nocedal J and Wright S J, Numerical Optimization, Springer, New York, 2006.zbMATHGoogle Scholar

Copyright information

© Institute of Systems Science, Academy of Mathematics and Systems Science, CAS and Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  1. 1.Department of MathematicsShanghai Normal UniversityShanghaiChina

Personalised recommendations