An augmented Lagrangian proximal alternating method for sparse discrete optimization problems
From MaRDI portal
Publication:2299205
Cites work
- scientific article; zbMATH DE number 1906319 (Why is no real title available?)
- A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
- A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes
- A globally convergent algorithm for nonconvex optimization based on block coordinate update
- A penalty PALM method for sparse portfolio selection problems
- Algorithm for cardinality-constrained quadratic optimization
- An augmented Lagrangian approach for sparse principal component analysis
- An augmented Lagrangian method for non-Lipschitz nonconvex programming
- An exact solution approach for portfolio optimization problems under stochastic and integer constraints
- Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
- Computational study of a family of mixed-integer quadratic programming problems
- Constraint qualifications and optimality conditions for optimization problems with cardinality constraints
- Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problems
- Exact augmented Lagrangian duality for mixed integer linear programming
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Heuristics for cardinality constrained portfolio optimization
- Lagrangian relaxation procedure for cardinality-constrained portfolio optimization
- Local search techniques for constrained portfolio selection problems
- Mathematical programs with cardinality constraints: reformulation by complementarity-type conditions and a regularization method
- OPTIMAL LOT SOLUTION TO CARDINALITY CONSTRAINED MEAN–VARIANCE FORMULATION FOR PORTFOLIO SELECTION
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Optimal cardinality constrained portfolio selection
- Optimization of cardinality constrained portfolios with a hybrid local search algorithm
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Robust investment strategies with discrete asset choice constraints using DC programming
- SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
- Semidefinite relaxations of fractional programs via novel convexification techniques
- Simulated annealing for complex portfolio selection problems.
- Sparse Approximation via Penalty Decomposition Methods
- Splitting augmented Lagrangian method for optimization problems with a cardinality constraint and semicontinuous variables
- Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Variational Analysis
Cited in
(5)- Using the KKT matrix in an augmented Lagrangian SQP method for sparse constrained optimization
- On Convergence of an Augmented Lagrangian Decomposition Method for Sparse Convex Optimization
- An accelerated proximal augmented Lagrangian method and its application in compressive sensing
- A sparse proximal implementation of the LP dual active set algorithm
- A proximal augmented method for semidefinite programming problems
This page was built for publication: An augmented Lagrangian proximal alternating method for sparse discrete optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2299205)
