Projection onto a Polyhedron that Exploits Sparsity
From MaRDI portal
Publication:2817841
DOI10.1137/15M102825XzbMath1346.90653MaRDI QIDQ2817841
Hongchao Zhang, William W. Hager
Publication date: 2 September 2016
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Quadratic programming (90C20) Complexity and performance of numerical algorithms (65Y20)
Related Items
An active set algorithm for nonlinear optimization with polyhedral constraints, Inexact alternating direction methods of multipliers for separable convex optimization, On the stationarity for nonlinear optimization problems with polyhedral constraints, Proximal gradient/semismooth Newton methods for projection onto a polyhedron via the duality-gap-active-set strategy, Variational analysis on the signed distance functions, Set-membership estimations for the evolution of infectious diseases in heterogeneous populations, On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope, Generalized uniformly optimal methods for nonlinear programming, A symmetric Gauss-Seidel based method for a class of multi-period mean-variance portfolio selection problems, Minimization over the \(\ell_1\)-ball using an active-set non-monotone projected gradient, An active-set algorithmic framework for non-convex optimization problems over the simplex
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- An augmented Lagrangian approach for sparse principal component analysis
- A Newton's method for the continuous quadratic knapsack problem
- Linear and nonlinear programming.
- A coordinate gradient descent method for nonsmooth separable minimization
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Analysis and implementation of a dual algorithm for constrained optimization
- Primal-dual strategy for state-constrained optimal control problems
- Novel approaches to hard discrete optimization
- Presolving in linear programming
- A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization
- Application of the dual active set algorithm to quadratic network optimization
- A sparse proximal implementation of the LP dual active set algorithm
- Dual multilevel optimization
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Multiple-Rank Modifications of a Sparse Cholesky Factorization
- Proximal Splitting Methods in Signal Processing
- Gradient-Based Methods for Sparse Recovery
- Dual Approximations in Optimal Control
- A New Active Set Algorithm for Box Constrained Optimization
- An algorithm for quadratic ℓ1-regularized optimization with a flexible active-set strategy
- Two-Point Step Size Gradient Methods
- An extended set of FORTRAN basic linear algebra subprograms
- LAPACK Users' Guide
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
- Generalized Gradients and Applications
- Basic Linear Algebra Subprograms for Fortran Usage
- Atomic Decomposition by Basis Pursuit
- Modifying a Sparse Cholesky Factorization
- Primal-Dual Strategy for Constrained Optimal Control Problems
- Numerical Optimization
- On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- Algorithm 679: A set of level 3 basic linear algebra subprograms: model implementation and test programs
- Semismooth Newton Methods for Operator Equations in Function Spaces
- Sparse Reconstruction by Separable Approximation
- A Nonmonotone Line Search Technique for Newton’s Method
- Error Bounds for Piecewise Convex Quadratic Programs and Applications
- An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem
- Row Modifications of a Sparse Cholesky Factorization
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- MA57---a code for the solution of sparse symmetric definite and indefinite systems
- Convergence Conditions for Ascent Methods
- Convergence Conditions for Ascent Methods. II: Some Corrections
- Benchmarking optimization software with performance profiles.
- The dual active set algorithm and its application to linear programming
