Abstract
Numerical methods for solving constrained optimization problems need to incorporate the constraints in a manner that satisfies essentially competing interests; the incorporation needs to be simple enough that the solution method is tractable, yet complex enough to ensure the validity of the ultimate solution. We introduce a framework for constraint incorporation that identifies a minimal acceptable level of complexity and defines two basic types of constraint incorporation which (with combinations) cover nearly all popular numerical methods for constrained optimization, including trust region methods, penalty methods, barrier methods, penalty-multiplier methods, and sequential quadratic programming methods. The broad application of our framework relies on addition and chain rules for constraint incorporation which we develop here.
Similar content being viewed by others
References
Ben-Tal A., Zibulevsky M. (1997) Penalty/barrier multiplier methods for convex programming problems. SIAM J. Optim. 7, 347–366
Boggs P., Tolle J. (1995) Sequential quadratic programming Acta numerica, Acta Numer. Cambridge University Press, Cambridge, pp. 1–51
Boukari D., Fiacco A.V. (1995) Survey of penalty, exact-penalty and multiplier methods from 1968 to 1993. Optimization 32, 301–334
Byrd R., Gould N., Nocedal J., Waltz R. (2004) An active set algorithm for nonlinear programming using linear programming and equality constrained subproblems. Math. Program. 100, 27–48
Contaldi G., DiPillo G., Lucidi S. (1993) A continuously differentiable exact penalty function for nonlinear programming problems with unbounded feasible set. Oper. Res. Lett. 14, 153–161
Demyanov V.F., DiPillo G., Facchinei F. (1998) Exact penalization via Dini and Hadamard conditional derivatives. Optim. Methods Softw. 9, 19–36
DiPillo G. (1994) Exact Penalty Methods. Algorithms for Continuous Optimization (Il Ciocco, 1993). NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci., Kluwer, Dordrecht 434, 209–253
DiPillo G., Facchinei F. (1995) Exact barrier function methods for Lipschitz programs. Appl. Math. Optim. 32, 1–31
DiPillo G., Facchinei F. Regularity conditions and exact penalty functions in Lipschitz programming problems. Nonsmooth optimization: methods and applications (Erice, 1991) pp. 107–120. Gordon and Breach, Montreux, (1992)
DiPillo G., Facchinei F., Grippo L. (1992) An RQP algorithm using a differentiable exact penalty function for inequality constrained problems. Math. Program. Series A 55, 49–68
DiPillo G., Grippo L., Lucidi S. (1997) Smooth transformation of the generalized minimax problem. J. Optim. Theory Appl. 95, 1–24
DiPillo G., Grippo L., Lucidi S. (1993) A smooth method for the finite minimax problem. Math. Program. 60, 187–214
DiPillo G., Lucidi S., Palagi L. (1999) A shifted-barrier primal-dual algorithm model for linearly constrained optimization problems. Comput. Optim. Appl. 12, 157–188
DiPillo G., Lucidi S., Palagi L. (1993) An exact penalty-Lagrangian approach for a class of constrained optimization problems with bounded variables. Optimization 28, 129–148
Facchinei F. (1997) Robust recursive quadratic programming algorithm model with global and superlinear convergence properties. J. Optim. Theory Appl. 92, 543–579
Facchinei F. (1991) Exact penalty functions and Lagrange multipliers. Optimization 22, 579–606
Facchinei F., Liuzzi G., Lucidi S. (2003) A truncated Newton method for the solution of large-scale inequality constrained minimization problems. Comput. Optim. Appl. 25, 85–122
Facchinei F., Lucidi S. (1998) Convergence to second-order stationary points in inequality constrained optimization. Math. Oper. Res. 23, 746–766
Facchinei F., Lucidi S. (1992) A class of penalty functions for optimization problems with bound constraints. Optimization 26, 239–259
Fletcher R. (1987) Practical Methods of Optimization. Wiley, New York
Nocedal J., Wright S.J. (1999) Numerical Optimization. Springer, Berlin Heidelberg New York
Rockafellar R.T., Wets R.J.-B. (1998) Variational Analysis. Springer, Berlin Heidelberg New York
Sadjadi S., Ponnambalam K.: Advances in trust region algorithms for constrained optimization. In: Proceedings of the Stieltjes Workshop on High Performance Optimization Techniques (Delft), Appl. Numer. Math. 29, 423–443 (1999)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Levy, A.B. Constraint incorporation in optimization. Math. Program. 110, 615–639 (2007). https://doi.org/10.1007/s10107-006-0016-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-006-0016-1