Sufficient conditions for metric subregularity of constraint systems with applications to disjunctive and ortho-disjunctive programs
From MaRDI portal
Publication:2116023
DOI10.1007/S11228-020-00569-7zbMATH Open1484.49025arXiv1906.08337OpenAlexW3121016538MaRDI QIDQ2116023FDOQ2116023
Authors: Matus Benko, Michal Červinka, T. Hoheisel 
Publication date: 15 March 2022
Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)
Abstract: This paper is devoted to the study of the metric subregularity constraint qualification (MSCQ) for general optimization problems, with the emphasis on the nonconvex setting. We elaborate on notions of directional pseudo- and quasi-normality, recently introduced by Bai et al. (SIAM J. Opt., 2019), which combine the standard approach via pseudo- and quasi-normality with modern tools of directional variational analysis. We focus on applications to disjunctive programs, where (directional) pseudo-normality is characterized via an extremal condition. This, in turn, yields efficient tools to verify pseudo-normality and MSCQ, which include, but are not limited to, Robinson's result on polyhedral multifunctions and Gfrerer's second-order sufficient condition for metric subregularity. Finally, we refine our study by defining the new class of ortho-disjunctive programs which comprises prominent optimization problems such as mathematical programs with complementarity, vanishing or switching constraints.
Full work available at URL: https://arxiv.org/abs/1906.08337
Recommendations
- Directional quasi-/pseudo-normality as sufficient conditions for metric subregularity
- On metric pseudo-(sub)regularity of multifunctions and optimality conditions for degenerated mathematical programs
- On directional metric subregularity and second-order optimality conditions for a class of nonsmooth mathematical programs
- On directional metric regularity, subregularity and optimality conditions for nonsmooth mathematical programs
- The metric subregularity of parametric constraint systems
metric subregularityMPCCerror bound propertydisjunctive programsMPVCortho-disjunctive programspseudo-/quasi-normality
Numerical optimization and variational techniques (65K10) Sensitivity, stability, parametric optimization (90C31) Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53)
Cites Work
- Variational Analysis
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Nonsmooth equations in optimization. Regularity, calculus, methods and applications
- Foundations of bilevel programming
- Title not available (Why is that?)
- Optimization and nonsmooth analysis
- Some continuity properties of polyhedral multifunctions
- On the Calmness of a Class of Multifunctions
- Multicriteria Optimization
- Implicit Functions and Solution Mappings
- Bi-level strategies in semi-infinite programming.
- Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints
- Vector Optimization
- On calculating the normal cone to a finite union of convex polyhedra†
- Mathematical Programs with Equilibrium Constraints
- Calmness and Exact Penalization
- An Exact Penalization Viewpoint of Constrained Optimization
- Error bounds and metric subregularity
- On metric pseudo-(sub)regularity of multifunctions and optimality conditions for degenerated mathematical programs
- On directional metric regularity, subregularity and optimality conditions for nonsmooth mathematical programs
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
- On metric and calmness qualification conditions in subdifferential calculus
- Calmness of constraint systems with applications
- Lipschitz and Hölder stability of optimization problems and generalized equations
- Nonlinear chance constrained problems: optimality conditions, regularization and solvers
- Optimality conditions for disjunctive programs based on generalized differentiation with application to mathematical programs with equilibrium constraints
- Constraint qualifications and optimality conditions for optimization problems with cardinality constraints
- On directional metric subregularity and second-order optimality conditions for a class of nonsmooth mathematical programs
- Error bounds: necessary and sufficient conditions
- Nonconvex Structures in Nonlinear Programming
- First-Order and Second-Order Conditions for Error Bounds
- On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
- Pseudonormality and a Lagrange multiplier theory for constrained optimization
- Mathematical programs with cardinality constraints: reformulation by complementarity-type conditions and a regularization method
- Mathematical Programs with Equilibrium Constraints: Enhanced Fritz John-conditions, New Constraint Qualifications, and Improved Exact Penalty Results
- Enhanced Karush-Kuhn-Tucker conditions for mathematical programs with equilibrium constraints
- On sufficient second order optimality conditions in multiobjective optimization
- Regularity and conditioning of solution mappings in variational analysis
- Error bounds, calmness and their applications in nonsmooth analysis
- Mathematical programs with geometric constraints in Banach spaces: enhanced optimality, exact penalty, and sensitivity
- On Lipschitzian properties of implicit multifunctions
- Variational analysis of regular mappings. Theory and applications
- Calculus for directional limiting normal cones and subdifferentials
- Variational analysis and applications
- Constrained Minima and Lipschitzian Penalties in Metric Spaces
- On estimating the regular normal cone to constraint systems and stationarity conditions
- Stationarity conditions and constraint qualifications for mathematical programs with switching constraints. With applications to either-or-constrained programming
- New verifiable stationarity concepts for a class of mathematical programs with disjunctive constraints
- On the linear independence constraint qualification in disjunctive programming
- Second-Order Variational Analysis of Parametric Constraint and Variational Systems
- Directional quasi-/pseudo-normality as sufficient conditions for metric subregularity
- Stability analysis for parameterized variational systems with implicit constraints
- Characterizations of tilt-stable minimizers in second-order cone programming
Cited In (10)
- Inexact penalty decomposition methods for optimization problems with geometric constraints
- Cardinality minimization, constraints, and regularization: a survey
- Mordukhovich stationarity for mathematical programs with switching constraints under weak constraint qualifications
- Optimality conditions and constraint qualifications for cardinality constrained optimization problems
- An augmented Lagrangian method for optimization problems with structured geometric constraints
- Directional quasi-/pseudo-normality as sufficient conditions for metric subregularity
- Relaxed constant positive linear dependence constraint qualification for disjunctive systems
- Optimality conditions and exact penalty for mathematical programs with switching constraints
- On the directional asymptotic approach in optimization theory
- Title not available (Why is that?)
This page was built for publication: Sufficient conditions for metric subregularity of constraint systems with applications to disjunctive and ortho-disjunctive programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2116023)
