On the weak stationarity conditions for mathematical programs with cardinality constraints: a unified approach

DOI10.1007/s00245-021-09752-0zbMath1478.90124arXiv2008.00019OpenAlexW3127372139MaRDI QIDQ2234331

Mael Sachine, Evelin H. M. Krulikovski, Ademir Alves Ribeiro

Publication date: 19 October 2021

Published in: Applied Mathematics and Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2008.00019

zbMATH Keywords

nonlinear programmingconstraint qualificationweak stationaritysparse solutionsmathematical programs with cardinality constraints

Mathematics Subject Classification ID

Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (4)

A low-cost alternating projection approach for a continuous formulation of convex and cardinality constrained optimization ⋮ On the fulfillment of the complementary approximate Karush-Kuhn-Tucker conditions and algorithmic applications ⋮ A strong sequential optimality condition for cardinality-constrained optimization problems ⋮ A comparative study of sequential optimality conditions for mathematical programs with cardinality constraints

Uses Software

• SNOPT

Cites Work

• On solutions of sparsity constrained optimization
• The first-order necessary conditions for sparsity constrained optimization
• Constraint qualifications and optimality conditions for optimization problems with cardinality constraints
• Recent advances in mathematical programming with semi-continuous variables and cardinality constraint
• 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
• On the approximate solutions of augmented subproblems within sequential methods for nonlinear programming
• Computational study of a family of mixed-integer quadratic programming problems
• On the augmented subproblems within sequential methods for nonlinear programming
• On M-stationary points for mathematical programs with equilibrium constraints
• A sequential quadratic programming method for potentially infeasible mathematical programs
• Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
• A Class of Globally Convergent Optimization Methods Based on Conservative Convex Separable Approximations
• Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
• Convergence of a local regularization approach for mathematical programmes with complementarity or vanishing constraints
• On a Reformulation of Mathematical Programs with Cardinality Constraints
• First-Order Methods in Optimization
• SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
• Optimization Problems with Cardinality Constraints
• Optimality Conditions for a Class of Mathematical Programs with Equilibrium Constraints
• New Sequential Optimality Conditions for Mathematical Programs with Complementarity Constraints and Algorithmic Consequences
• Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method
• Mathematical programs with equilibrium constraints: a sequential optimality condition, new constraint qualifications and algorithmic consequences
• The elements of statistical learning. Data mining, inference, and prediction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the weak stationarity conditions for mathematical programs with cardinality constraints: a unified approach