Relaxed method for optimization problems with cardinality constraints
DOI10.1007/S10898-023-01317-5OpenAlexW4384500475MaRDI QIDQ6154400FDOQ6154400
Authors: Yan-Chao Liang, Guihua 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
Recommendations
- Constraint qualifications and optimality conditions for optimization problems with cardinality constraints
- On the weak stationarity conditions for mathematical programs with cardinality constraints: a unified approach
- Optimality conditions and constraint qualifications for cardinality constrained optimization problems
- On a Reformulation of Mathematical Programs with Cardinality Constraints
- Mathematical programs with cardinality constraints: reformulation by complementarity-type conditions and a regularization method
global convergenceconstraint qualificationsrelaxed methodM-stationarityS-stationarityoptimization problems with cardinality constraint
Optimality conditions and duality in mathematical programming (90C46) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Title not available (Why is that?)
- Second-order optimality conditions and improved convergence results for regularization methods for cardinality-constrained optimization problems
- SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
- Computational study of a family of mixed-integer quadratic programming problems
- A local relaxation method for the cardinality constrained portfolio optimization problem
- Recent advances in mathematical programming with semi-continuous variables and cardinality constraint
- Algorithm for cardinality-constrained quadratic optimization
- Constraint qualifications and optimality conditions for optimization problems with cardinality constraints
- The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited
- A concave optimization-based approach for sparse portfolio selection
- Optimization problems with cardinality constraints
- Mathematical programs with cardinality constraints: reformulation by complementarity-type conditions and a regularization method
- Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach
- A new regularization scheme for mathematical programs with complementarity constraints
- Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization
- Sequential optimality conditions for cardinality-constrained optimization problems with applications
- An augmented Lagrangian method for cardinality-constrained optimization problems
Cited In (1)
This page was built for publication: Relaxed method for optimization problems with cardinality constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6154400)
