Inexact primal–dual gradient projection methods for nonlinear optimization on convex set
From MaRDI portal
Publication:5151505
DOI10.1080/02331934.2019.1696338zbMath1460.90185arXiv1911.07758OpenAlexW2992495959MaRDI QIDQ5151505
Jiashan Wang, Kai Yang, Hao Wang, Fan Zhang
Publication date: 19 February 2021
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.07758
proximal methodsfirst-order methodsgradient projection methodsinexact optimization\(\ell_1\)-ball projection
Related Items (2)
Inexact gradient projection method with relative error tolerance ⋮ On the inexact scaled gradient projection method
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis
- Fast projection onto the simplex and the \(l_1\) ball
- Gradient methods for minimizing composite functions
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
- Introductory lectures on convex optimization. A basic course.
- On the truncated conjugate gradient method
- A survey on the continuous nonlinear resource allocation problem
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Generalized power method for sparse principal component analysis
- Probing the Pareto Frontier for Basis Pursuit Solutions
- Two-Point Step Size Gradient Methods
- Linear Matrix Inequalities in System and Control Theory
- Inexact spectral projected gradient methods on convex sets
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- On the Convergence of Inexact Projection Primal First-Order Methods for Convex Minimization
- Solving monotone inclusions via compositions of nonexpansive averaged operators
- A Nonmonotone Line Search Technique for Newton’s Method
- Conditional Gradient Algorithmsfor Rank-One Matrix Approximations with a Sparsity Constraint
- Living on the edge: phase transitions in convex programs with random data
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- Algorithm 813
- Stable signal recovery from incomplete and inaccurate measurements
- Proximité et dualité dans un espace hilbertien
- Convex programming in Hilbert space
- The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
- The Gradient Projection Method under Mild Differentiability Conditions
This page was built for publication: Inexact primal–dual gradient projection methods for nonlinear optimization on convex set
