Constraint qualifications and optimality conditions for optimization problems with cardinality constraints
From MaRDI portal
Publication:344949
DOI10.1007/s10107-016-0986-6zbMath1356.90146OpenAlexW2187547409MaRDI QIDQ344949
Michal Červinka, Alexandra Schwartz, Christian Kanzow
Publication date: 25 November 2016
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-016-0986-6
optimality conditionscardinality constraintsconstraint qualificationsKKT conditionsstrongly stationary points
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Critical point theory for sparse recovery, Optimality conditions for sparse nonlinear programming, Sparsity constrained optimization problems via disjunctive programming, Nonlinear chance constrained problems: optimality conditions, regularization and solvers, Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization, Second-order optimality conditions and improved convergence results for regularization methods for cardinality-constrained optimization problems, A new algorithm for quadratic integer programming problems with cardinality constraint, The last dozen of years of or research in Czechia and Slovakia, Restricted Robinson constraint qualification and optimality for cardinality-constrained cone programming, An augmented Lagrangian method for optimization problems with structured geometric constraints, Stationarity conditions and constraint qualifications for mathematical programs with switching constraints. With applications to either-or-constrained programming, Solution sets of three sparse optimization problems for multivariate regression, Second-Order Optimality Conditions for General Nonconvex Optimization Problems and Variational Analysis of Disjunctive Systems, A unifying framework for sparsity-constrained optimization, Relaxed method for optimization problems with cardinality constraints, A strong sequential optimality condition for cardinality-constrained optimization problems, Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation, A Sequential Algorithm for Solving Nonlinear Optimization Problems with Chance Constraints, On the weak stationarity conditions for mathematical programs with cardinality constraints: a unified approach, On the linear independence constraint qualification in disjunctive programming, A quadratic penalty method for hypergraph matching, Sequential optimality conditions for cardinality-constrained optimization problems with applications, An augmented Lagrangian method for cardinality-constrained optimization problems, An augmented Lagrangian proximal alternating method for sparse discrete optimization problems, A Lagrange-Newton algorithm for sparse nonlinear programming, On nondegenerate M-stationary points for sparsity constrained nonlinear optimization, Sufficient conditions for metric subregularity of constraint systems with applications to disjunctive and ortho-disjunctive programs, A comparative study of sequential optimality conditions for mathematical programs with cardinality constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Recent advances in mathematical programming with semi-continuous variables and cardinality constraint
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach
- Algorithm for cardinality-constrained quadratic optimization
- Foundations of optimization
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Complementarity constraint qualifications and simplified \(B\)-stationary conditions for mathematical programs with equilibrium constraints
- On the relation between constant positive linear dependence condition and quasinormality constraint qualification
- Computational study of a family of mixed-integer quadratic programming problems
- Pseudonormality and a Lagrange multiplier theory for constrained optimization
- A local relaxation method for the cardinality constrained portfolio optimization problem
- Abadie-type constraint qualification for mathematical programs with equilibrium constraints
- Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints
- Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
- Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
- A concave optimization-based approach for sparse portfolio selection
- Optimality Conditions via Exact Penalty Functions
- Numerical Optimization
- Variational Analysis
- Constraint Qualifications and Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
- On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
- Optimization Problems with Cardinality Constraints
- Optimality Conditions for a Class of Mathematical Programs with Equilibrium Constraints
- Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method
- Mathematical Programs with Equilibrium Constraints
