An augmented Lagrangian proximal alternating method for sparse discrete optimization problems

DOI10.1007/s11075-019-00705-xOpenAlexW2945088056WikidataQ127862424 ScholiaQ127862424MaRDI QIDQ2299205

Li Yang, Bo Yu, Xiaoliang Song, Yue Teng

Publication date: 20 February 2020

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-019-00705-x

zbMATH Keywords

augmented Lagrangian methodproximal alternating linearized minimization methoddiscrete constrained optimizationsparse projection\(l_0\) minimization

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• Constraint qualifications and optimality conditions for optimization problems with cardinality constraints
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Exact augmented Lagrangian duality for mixed integer linear programming
• An augmented Lagrangian approach for sparse principal component analysis
• Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach
• A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes
• Algorithm for cardinality-constrained quadratic optimization
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• Simulated annealing for complex portfolio selection problems.
• Optimization of cardinality constrained portfolios with a hybrid local search algorithm
• Heuristics for cardinality constrained portfolio optimization
• A globally convergent algorithm for nonconvex optimization based on block coordinate update
• Computational study of a family of mixed-integer quadratic programming problems
• Local search techniques for constrained portfolio selection problems
• Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problems
• Perspective cuts for a class of convex 0-1 mixed integer programs
• Perspective reformulations of mixed integer nonlinear programs with indicator variables
• SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
• Splitting augmented Lagrangian method for optimization problems with a cardinality constraint and semicontinuous variables
• Optimal Cardinality Constrained Portfolio Selection
• A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
• An Augmented Lagrangian Method for Non-Lipschitz Nonconvex Programming
• An Exact Solution Approach for Portfolio Optimization Problems Under Stochastic and Integer Constraints
• Lagrangian relaxation procedure for cardinality-constrained portfolio optimization
• Robust investment strategies with discrete asset choice constraints using DC programming
• Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• Variational Analysis
• A penalty PALM method for sparse portfolio selection problems
• Sparse Approximation via Penalty Decomposition Methods
• The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
• OPTIMAL LOT SOLUTION TO CARDINALITY CONSTRAINED MEAN–VARIANCE FORMULATION FOR PORTFOLIO SELECTION
• Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method
• Semidefinite relaxations of fractional programs via novel convexification techniques

This page was built for publication: An augmented Lagrangian proximal alternating method for sparse discrete optimization problems