Splitting augmented Lagrangian method for optimization problems with a cardinality constraint and semicontinuous variables
From MaRDI portal
Publication:2829575
DOI10.1080/10556788.2016.1196206zbMath1355.90053OpenAlexW2468458883MaRDI QIDQ2829575
Renli Liang, Zhou-Wang Yang, Yan-Qin Bai
Publication date: 8 November 2016
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2016.1196206
alternating direction method of multipliersaugmented Lagrangian decompositioncardinality constraint and semicontinuous variables optimization problem
Related Items (3)
A splitting method for the locality regularized semi-supervised subspace clustering ⋮ Distributed primal outer approximation algorithm for sparse convex programming with separable structures ⋮ An augmented Lagrangian proximal alternating method for sparse discrete optimization problems
Uses Software
Cites Work
- Recent advances in mathematical programming with semi-continuous variables and cardinality constraint
- Consensus proximal support vector machine for classification problems with sparse solutions
- Algorithm for cardinality-constrained quadratic optimization
- Heuristics for cardinality constrained portfolio optimization
- Computational study of a family of mixed-integer quadratic programming problems
- Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problems
- A polynomial case of the cardinality-constrained quadratic optimization problem
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Alternating direction method of multipliers for \(\ell_{1}\)-\(\ell_{2}\)-regularized logistic regression model
- Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach
- A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
- An Exact Solution Approach for Portfolio Optimization Problems Under Stochastic and Integer Constraints
- On the Convergence of Augmented Lagrangian Methods for Constrained Global Optimization
- Atomic Decomposition by Basis Pursuit
- Sparse Recovery of Nonnegative Signals With Minimal Expansion
- Sparse Approximation via Penalty Decomposition Methods
- Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method
- Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
This page was built for publication: Splitting augmented Lagrangian method for optimization problems with a cardinality constraint and semicontinuous variables
