Mathematical Programs with Vanishing Constraints: Optimality Conditions, Sensitivity, and a Relaxation Method

A. F. Izmailov () and M. V. Solodov ()
Additional contact information
A. F. Izmailov: Moscow State University
M. V. Solodov: IMPA—Instituto de Matemática Pura e Aplicada

Journal of Optimization Theory and Applications, 2009, vol. 142, issue 3, No 5, 532 pages

Abstract: Abstract We consider a class of optimization problems with switch-off/switch-on constraints, which is a relatively new problem model. The specificity of this model is that it contains constraints that are being imposed (switched on) at some points of the feasible region, while being disregarded (switched off) at other points. This seems to be a potentially useful modeling paradigm, that has been shown to be helpful, for example, in optimal topology design. The fact that some constraints “vanish” from the problem at certain points, gave rise to the name of mathematical programs with vanishing constraints (MPVC). It turns out that such problems are usually degenerate at a solution, but are structurally different from the related class of mathematical programs with complementarity constraints (MPCC). In this paper, we first discuss some known first- and second-order necessary optimality conditions for MPVC, giving new very short and direct justifications. We then derive some new special second-order sufficient optimality conditions for these problems and show that, quite remarkably, these conditions are actually equivalent to the classical/standard second-order sufficient conditions in optimization. We also provide a sensitivity analysis for MPVC. Finally, a relaxation method is proposed. For this method, we analyze constraints regularity and boundedness of the Lagrange multipliers in the relaxed subproblems, derive a sufficient condition for local uniqueness of solutions of subproblems, and give convergence estimates.

Keywords: Mathematical program with vanishing constraints; Stationarity; Second-order conditions; Sensitivity; Relaxation (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://link.springer.com/10.1007/s10957-009-9517-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:142:y:2009:i:3:d:10.1007_s10957-009-9517-4

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-009-9517-4

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().