Error bounds for non-polyhedral convex optimization and applications to linear convergence of FDM and PGM

DOI10.1016/J.AMC.2019.04.048zbMATH Open1428.90121OpenAlexW2944273148MaRDI QIDQ2279378FDOQ2279378

Authors: Shujun Bi, Yulan Liu 

Publication date: 12 December 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2019.04.048

Recommendations

• A unified approach to error bounds for structured convex optimization problems
• scientific article; zbMATH DE number 7404502
• Error bounds, quadratic growth, and linear convergence of proximal methods
• On the linear convergence of a proximal gradient method for a class of nonsmooth convex minimization problems
• Approximation accuracy, gradient methods, and error bound for structured convex optimization

zbMATH Keywords

convergence ratelocal error boundsinexact feasible descent methodinexact proximal gradient methodnon-polyhedral convex optimization

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30)

Cites Work

• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Variational Analysis
• Introductory lectures on convex optimization. A basic course.
• Gradient methods for minimizing composite functions
• A coordinate gradient descent method for nonsmooth separable minimization
• Title not available (Why is that?)
• Title not available (Why is that?)
• Convex programming in Hilbert space
• Title not available (Why is that?)
• Error bounds in mathematical programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• On linear convergence of iterative methods for the variational inequality problem
• Two-Metric Projection Methods for Constrained Optimization
• On the convergence of block coordinate descent type methods
• Local Linear Convergence of the Alternating Direction Method of Multipliers for Quadratic Programs
• Convex multi-task feature learning
• Error bounds and convergence analysis of feasible descent methods: A general approach
• On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
• Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
• Global Error Bounds for Convex Conic Problems
• Weak sharp minima revisited. I: Basic theory
• A subdifferential condition for calmness of multifunctions
• Computable error bounds for semidefinite programming
• On the convergence of the coordinate descent method for convex differentiable minimization
• Global error bounds for convex multifunctions and applications
• Linear convergence of first order methods for non-strongly convex optimization
• Title not available (Why is that?)
• A unified approach to error bounds for structured convex optimization problems
• Error bounds for nondifferentiable convex inequalities under a strong Slater constraint qualification

Cited In (6)

• A global dual error bound and its application to the analysis of linearly constrained nonconvex optimization
• New error bounds and their applications to convergence analysis of iterative algorithms
• Convergence and error bound for perturbation of linear programs
• From error bounds to the complexity of first-order descent methods for convex functions
• Error Bound and Reduced-Gradient Projection Algorithms for Convex Minimization over a Polyhedral Set
• The restricted strong convexity revisited: analysis of equivalence to error bound and quadratic growth

This page was built for publication: Error bounds for non-polyhedral convex optimization and applications to linear convergence of FDM and PGM

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2279378)