Projection onto a polyhedron that exploits sparsity
From MaRDI portal
(Redirected from Publication:2817841)
Recommendations
- Static Analysis
- scientific article; zbMATH DE number 3924512
- The polyhedral projection problem
- A Simultaneous Iterative Method for Computing Projections on Polyhedra
- 10.1007/s11470-008-3004-0
- Approximating polyhedra with sparse inequalities
- Solution of projection problems over polytopes
- Orthogonal projections based on hyperbolic and spherical n-simplex
- Computing Nice Projections of Convex Polyhedra
- Computing nice projections of convex polyhedra
Cites work
- scientific article; zbMATH DE number 6378119 (Why is no real title available?)
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 5359577 (Why is no real title available?)
- scientific article; zbMATH DE number 724210 (Why is no real title available?)
- scientific article; zbMATH DE number 1424215 (Why is no real title available?)
- scientific article; zbMATH DE number 3247810 (Why is no real title available?)
- scientific article; zbMATH DE number 3281211 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A New Active Set Algorithm for Box Constrained Optimization
- A Newton's method for the continuous quadratic knapsack problem
- A Nonmonotone Line Search Technique for Newton’s Method
- A coordinate gradient descent method for nonsmooth separable minimization
- A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization
- A sparse proximal implementation of the LP dual active set algorithm
- Algorithm 679: A set of level 3 basic linear algebra subprograms: model implementation and test programs
- An algorithm for quadratic \(\ell_1\)-regularized optimization with a flexible active-set strategy
- An augmented Lagrangian approach for sparse principal component analysis
- An efficient hybrid algorithm for the separable convex quadratic knapsack problem
- An extended set of FORTRAN basic linear algebra subprograms
- Analysis and implementation of a dual algorithm for constrained optimization
- Application of the dual active set algorithm to quadratic network optimization
- Atomic Decomposition by Basis Pursuit
- Basic Linear Algebra Subprograms for Fortran Usage
- Benchmarking optimization software with performance profiles.
- Convergence Conditions for Ascent Methods
- Convergence Conditions for Ascent Methods. II: Some Corrections
- Dual Approximations in Optimal Control
- Dual multilevel optimization
- Error Bounds for Piecewise Convex Quadratic Programs and Applications
- Error bounds and convergence analysis of feasible descent methods: A general approach
- 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
- Generalized Gradients and Applications
- Gradient-based methods for sparse recovery
- LAPACK Users' Guide
- Linear and nonlinear programming.
- MA57---a code for the solution of sparse symmetric definite and indefinite systems
- Modifying a Sparse Cholesky Factorization
- Multiple-rank modifications of a sparse Cholesky factorization
- Novel approaches to hard discrete optimization
- 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
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Presolving in linear programming
- Primal-Dual Strategy for Constrained Optimal Control Problems
- Primal-dual strategy for state-constrained optimal control problems
- Proximal splitting methods in signal processing
- Row Modifications of a Sparse Cholesky Factorization
- Semismooth Newton Methods for Operator Equations in Function Spaces
- Sparse Reconstruction by Separable Approximation
- The dual active set algorithm and its application to linear programming
- Two-Point Step Size Gradient Methods
Cited in
(20)- Inexact alternating direction methods of multipliers for separable convex optimization
- On the stationarity for nonlinear optimization problems with polyhedral constraints
- Monotonicity in quadratically regularized linear programs
- Variational analysis on the signed distance functions
- Quantitative convergence of quadratically regularized linear programs
- An active set algorithm for nonlinear optimization with polyhedral constraints
- Subgradient regularized multivariate convex regression at scale
- Projections onto polyhedral sets: an improved finite step method and new distributed projection methods
- An active-set algorithmic framework for non-convex optimization problems over the simplex
- Static Analysis
- Algorithm 1035: a gradient-based implementation of the polyhedral active set algorithm
- Spectrally constrained optimization
- Proximal gradient/semismooth Newton methods for projection onto a polyhedron via the duality-gap-active-set strategy
- Optimization over convex polyhedra via Hadamard parametrizations
- Optimally sparse representations of cartoon-like cylindrical data
- On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope
- A symmetric Gauss-Seidel based method for a class of multi-period mean-variance portfolio selection problems
- Generalized uniformly optimal methods for nonlinear programming
- Minimization over the _1-ball using an active-set non-monotone projected gradient
- Set-membership estimations for the evolution of infectious diseases in heterogeneous populations
Describes a project that uses
Uses Software
This page was built for publication: Projection onto a polyhedron that exploits sparsity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817841)
