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

DOI10.1155/2013/492305zbMATH Open1291.90170OpenAlexW2091929055WikidataQ58916882 ScholiaQ58916882MaRDI QIDQ2015595FDOQ2015595

Authors: 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

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

Mathematics Subject Classification ID

Convex programming (90C25)

Cites Work

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

Cited In (3)

• Title not available (Why is that?)
• A modified self-adaptive dual ascent method with relaxed stepsize condition for linearly constrained quadratic convex optimization
• Improved Lagrangian-PPA based prediction correction method for linearly constrained convex optimization

Uses Software

• PDCO
• TFOCS

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)