A general self-adaptive relaxed-PPA method for convex programming with linear constraints

DOI10.1155/2013/492305zbMath1291.90170OpenAlexW2091929055WikidataQ58916882 ScholiaQ58916882MaRDI QIDQ2015595

Xiaoling Fu

Publication date: 23 June 2014

Published in: Abstract and Applied Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/492305

Mathematics Subject Classification ID

Convex programming (90C25)

Uses Software

• PDCO
• TFOCS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Computing the nearest correlation matrix--a problem from finance
• An interior proximal point algorithm for nonlinear complementarity problems
• Inexact proximal point method for general variational inequalities
• Proximal methods for nonlinear programming: Double regularization and inexact subproblems
• Proximal-point algorithm using a linear proximal term
• Approximate iterations in Bregman-function-based proximal algorithms
• Comparison of two kinds of prediction-correction methods for monotone variational inequalities
• Templates for convex cone problems with applications to sparse signal recovery
• Self-adaptive projection-based prediction-correction method for constrained variational inequalities
• A class of projection and contraction methods for monotone variational inequalities
• Multiplier and gradient methods
• Exact matrix completion via convex optimization
• Atomic Decomposition by Basis Pursuit
• A Singular Value Thresholding Algorithm for Matrix Completion
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• On the Convergence of the Proximal Point Algorithm for Convex Minimization
• Monotone Operators and the Proximal Point Algorithm
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• A Variable Metric Proximal Point Algorithm for Monotone Operators
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• A preconditioned Newton algorithm for the nearest correlation matrix
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Least-Squares Covariance Matrix Adjustment
• Improvements of some projection methods for monotone nonlinear variational inequalities

This page was built for publication: A general self-adaptive relaxed-PPA method for convex programming with linear constraints