A general self-adaptive relaxed-PPA method for convex programming with linear constraints
From MaRDI portal
Publication:2015595
Recommendations
- On relaxation of some customized proximal point algorithms for convex minimization: from variational inequality perspective
- A customized proximal point algorithm for convex minimization with linear constraints
- Relaxed augmented Lagrangian-based proximal point algorithms for convex optimization with linear constraints
- scientific article; zbMATH DE number 6270284
- Two new customized proximal point algorithms without relaxation for linearly constrained convex optimization
Cites work
- scientific article; zbMATH DE number 3534286 (Why is no real title available?)
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- scientific article; zbMATH DE number 6270284 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- A Singular Value Thresholding Algorithm for Matrix Completion
- A Variable Metric Proximal Point Algorithm for Monotone Operators
- A class of projection and contraction methods for monotone variational inequalities
- A preconditioned Newton algorithm for the nearest correlation matrix
- An interior proximal point algorithm for nonlinear complementarity problems
- Approximate iterations in Bregman-function-based proximal algorithms
- Atomic decomposition by basis pursuit
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Comparison of two kinds of prediction-correction methods for monotone variational inequalities
- Computing the nearest correlation matrix--a problem from finance
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Exact matrix completion via convex optimization
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Improvements of some projection methods for monotone nonlinear variational inequalities
- Inexact proximal point method for general variational inequalities
- Least-Squares Covariance Matrix Adjustment
- Monotone Operators and the Proximal Point Algorithm
- Multiplier and gradient methods
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- Proximal methods for nonlinear programming: Double regularization and inexact subproblems
- Proximal-point algorithm using a linear proximal term
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Self-adaptive projection-based prediction-correction method for constrained variational inequalities
- Templates for convex cone problems with applications to sparse signal recovery
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
Cited in
(3)- Improved Lagrangian-PPA based prediction correction method for linearly constrained convex optimization
- scientific article; zbMATH DE number 6270284 (Why is no real title available?)
- A modified self-adaptive dual ascent method with relaxed stepsize condition for linearly constrained quadratic convex optimization
This page was built for publication: A general self-adaptive relaxed-PPA method for convex programming with linear constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2015595)
