Relaxed method for optimization problems with cardinality constraints

DOI10.1007/s10898-023-01317-5OpenAlexW4384500475MaRDI QIDQ6154400

Yan-Chao Liang, Gui-Hua Lin

Publication date: 15 February 2024

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-023-01317-5

zbMATH Keywords

global convergenceconstraint qualificationsrelaxed methodM-stationarityS-stationarityoptimization problems with cardinality constraint

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)

Cites Work

• Unnamed Item
• Constraint qualifications and optimality conditions for optimization problems with cardinality constraints
• Recent advances in mathematical programming with semi-continuous variables and cardinality constraint
• Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach
• Algorithm for cardinality-constrained quadratic optimization
• 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
• Computational study of a family of mixed-integer quadratic programming problems
• A local relaxation method for the cardinality constrained portfolio optimization problem
• Sequential optimality conditions for cardinality-constrained optimization problems with applications
• An augmented Lagrangian method for cardinality-constrained optimization problems
• SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
• A concave optimization-based approach for sparse portfolio selection
• Optimization Problems with Cardinality Constraints
• A New Regularization Scheme for Mathematical Programs with Complementarity Constraints
• The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited
• Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method

This page was built for publication: Relaxed method for optimization problems with cardinality constraints