Abstract
A new class of optimization problems is discussed in which some constraints must hold in certain regions of the corresponding space rather than everywhere. In particular, the optimal design of topologies for mechanical structures can be reduced to problems of this kind. Problems in this class are difficult to analyze and solve numerically because their constraints are usually irregular. Some known first- and second-order necessary conditions for local optimality are refined for problems with vanishing constraints, and special Newton-type methods are developed for solving such problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
W. Achtziger and C. Kanzow, “Mathematical Programs with Vanishing Constraints: Optimality Conditions and Constraint Qualifications,” Math. Program., 114(1), 69–99 (2007).
T. Hoheisel and C. Kanzow, “On the Abadie and Guignard Constraint Qualifications for Mathematical Programs with Vanishing Constraints,” Optimization. DOI 10.1080/02331930701763405.
T. Hoheisel and C. Kanzow, “Stationarity Conditions for Mathematical Programs with Vanishing Constraints using Weak Constraint Qualifications,” J. Math. Anal. Appl. 337, 292–310 (2008).
T. Hoheisel and C. Kanzow, First- and Second-Order Optimality Conditions for Mathematical Programs with Vanishing Constraints,” Appl. of Math. 52, 495–514 (2007).
A. F. Izmailov and M. V. Solodov, “Mathematical Programs with Vanishing Constraints: Optimality Conditions, Sensitivity, and a Relaxation Method,” J. Optim. Theory Appl. (2009) DOI 10.1007/810957-009-9517-4
Z.-Q. Luo, J.-S. Pang, and D. Ralph, Mathematical Programs with Equilibrium Constraints (Cambridge Univ. Press, Cambridge, 1996).
J. V. Outrata, M. Kocvara, and J. Zowe, Nonsmooth Approach to Mathematical Programs with Equilibrium Constraints: Theory, Applications, and Numerical Results (Kluwer, Boston, 1998).
A. F. Izmailov, “Mathematical Programs with Complementarity Constraints: Regularity, Optimality Conditions, and Sensitivity,” Zh. Vychisl. Mat. Mat. Fiz. 44(7), 1209–1228 (2004) [Comput. Math. Math. Phys. 44, 1145–1164 (2004)].
A. F. Izmailov, Sensitivity in Optimization (Fizmatlit, Moscow, 2006) [in Russian].
A. F. Izmailov and V. M. Solodov, Numerical Optimization Methods, 2nd. ed. (Fizmatlit, Moscow, 2008) [in Russian].
D. Ralph, “Sequential Quadratic Programming for Mathematical Programs with Linear Complementarity Constraints,” Computational Techniques and Applications CTAC95 (World Sci., Singapore, 1996), pp. 663–668.
J. F. Bonnans, “Local Analysis of Newton-Type Methods for Variational Inequalities and Nonlinear Programming,” Appl. Math. Optim. 29, 161–186 (1994).
A. F. Izmailov and M. V. Solodov, “An Active-Set Newton Method for Mathematical Programs with Complementarity Constraints,” SIAM J. Optim. 19, 1003–1027 (2008).
F. Facchinei, A. Fischer, and C. Kanzow, “On the Accurate Identification of Active Constraints,” SIAM. J. Optim. 9, 14–32 (1999).
W. W. Hager and M. S. Gowda, “Stability in the Presence of Degeneracy and Error Estimation,” Math. Program. 85, 181–192 (1999).
A. Fischer, “Local Behavior of an Iterative Framework for Generalized Equations with Nonisolated Solutions,” Math. Program. 94, 91–124 (2002).
A. F. Izmailov and M. V. Solodov, “Newton-Type Methods for Optimization Problems without Constraint Qualifications,” SIAM J. Optim. 15, 210–228 (2004).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © A.F. Izmailov, A.L. Pogosyan, 2009, published in Zhurnal Vychislitel’noi Matematiki i Matematicheskoi Fiziki, 2009, Vol. 49, No. 7, pp. 1184–1196.
Rights and permissions
About this article
Cite this article
Izmailov, A.F., Pogosyan, A.L. Optimality conditions and newton-type methods for mathematical programs with vanishing constraints. Comput. Math. and Math. Phys. 49, 1128–1140 (2009). https://doi.org/10.1134/S0965542509070069
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0965542509070069