Sparsity constrained optimization problems via disjunctive programming

DOI10.1080/02331934.2021.1892675zbMath1503.90100OpenAlexW3134520835MaRDI QIDQ5039398

M. Sarabadan, Nooshin Movahedian, Soghra Nobakhtian

Publication date: 12 October 2022

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2021.1892675

zbMATH Keywords

optimality conditionsnonlinear programmingstationarityconstraint qualificationsparsity constrained optimization

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)

Uses Software

• JPEG2000

Cites Work

• Unnamed Item
• On solutions of sparsity constrained optimization
• The first-order necessary conditions for sparsity constrained optimization
• DC approximation approaches for sparse optimization
• Constraint qualifications and optimality conditions for optimization problems with cardinality constraints
• Restricted normal cones and sparsity optimization with affine constraints
• Algorithm for cardinality-constrained quadratic optimization
• A note on the convergence of barrier algorithms to second-order necessary points
• A local relaxation method for the cardinality constrained portfolio optimization problem
• New constraint qualifications with second-order properties in nonlinear optimization
• Nonsmooth sparsity constrained optimization problems: optimality conditions
• A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems
• Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints
• Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
• Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
• On strong and weak second-order necessary optimality conditions for nonlinear programming
• Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
• Optimality Conditions for Disjunctive Programs Based on Generalized Differentiation with Application to Mathematical Programs with Equilibrium Constraints
• Lipschitzian stability of constraint systems and generalized equations
• Sparse Approximate Solutions to Linear Systems
• De-noising by soft-thresholding
• On the linear independence constraint qualification in disjunctive programming
• Sparse Approximation via Penalty Decomposition Methods
• Foundations of Optimization

This page was built for publication: Sparsity constrained optimization problems via disjunctive programming