Proximal gradient/semismooth Newton methods for projection onto a polyhedron via the duality-gap-active-set strategy
From MaRDI portal
Publication:6176299
Recommendations
- Projection onto a polyhedron that exploits sparsity
- scientific article; zbMATH DE number 999656
- scientific article; zbMATH DE number 1424215
- Nonsmooth penalty and subgradient algorithms to solve the problem of projection onto a polytope
- Efficient projection onto the intersection of a half-space and a box-like set and its generalized Jacobian
Cites work
- A brief introduction to manifold optimization
- A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization, and continuation
- A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems
- A linear separability criterion for sets of Euclidean space
- A New Active Set Algorithm for Box Constrained Optimization
- A Newton-CG augmented Lagrangian method for semidefinite programming
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A nonsmooth version of Newton's method
- A projected gradient and constraint linearization method for nonlinear model predictive control
- Alternate step gradient method*
- An accelerated active-set algorithm for a quadratic semidefinite program with general constraints
- An active set algorithm for nonlinear optimization with polyhedral constraints
- An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints
- Benchmarking optimization software with performance profiles.
- Computational acceleration of projection algorithms for the linear best approximation problem
- Convex Analysis
- Cost Approximation: A Unified Framework of Descent Algorithms for Nonlinear Programs
- DC formulations and algorithms for sparse optimization problems
- Efficient projection onto the intersection of a half-space and a box-like set and its generalized Jacobian
- Equipping the Barzilai-Borwein method with the two dimensional quadratic termination property
- Error bounds, quadratic growth, and linear convergence of proximal methods
- Fast projection onto the simplex and the l₁ ball
- Fastest Mixing Markov Chain on a Graph
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- First-order methods in optimization
- Gap safe screening rules for sparsity enforcing penalties
- Gradient methods with adaptive step-sizes
- scientific article; zbMATH DE number 1667417 (Why is no real title available?)
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 2221955 (Why is no real title available?)
- Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions
- Introduction to nonsmooth optimization. Theory, practice and software
- Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
- Nonsmooth penalty and subgradient algorithms to solve the problem of projection onto a polytope
- On quasi-Newton forward-backward splitting: proximal calculus and convergence
- On the acceleration of the Barzilai-Borwein method
- Projection onto a polyhedron that exploits sparsity
- Proximal Newton-type methods for minimizing composite functions
- Riemannian Optimization on the Symplectic Stiefel Manifold
- Safe Feature Elimination in Sparse Supervised Learning
- Semismooth and Semiconvex Functions in Constrained Optimization
- Semismooth Matrix-Valued Functions
- Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations
- Sparse Reconstruction by Separable Approximation
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Two-Point Step Size Gradient Methods
This page was built for publication: Proximal gradient/semismooth Newton methods for projection onto a polyhedron via the duality-gap-active-set strategy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6176299)
