A unified approach to error bounds for structured convex optimization problems (Q1675267): Difference between revisions

The authors employ tools from set-valued analysis to develop a new framework for establish error bounds for a class of structured convex problems. It is shown that such a framework can be used to recover a number of existing error bound results in a unified and transparent manner.

0 references

reviewed by

Hans Benker

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

convex optimization problems

0 references

error bound

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

0 references

Convex multi-task feature learning

0 references

Optimal Hoffman-type estimates in eigenvalue and semidefinite inequality constraints

0 references

On Projection Algorithms for Solving Convex Feasibility Problems

0 references

Strong conical hull intersection property, bounded linear regularity, Jameson's property $(G)$, and error bounds in convex optimization

0 references

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

0 references

Signal Recovery by Proximal Forward-Backward Splitting

0 references

An introduction to a class of matrix cone programming

0 references

Implicit Functions and Solution Mappings

0 references

Finite-Dimensional Variational Inequalities and Complementarity Problems

0 references

Local behavior of an iterative framework for generalized equations with nonisolated solutions

0 references

Recovering Low-Rank Matrices From Few Coefficients in Any Basis

0 references

Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence

0 references

Approximation accuracy, gradient methods, and error bound for structured convex optimization

0 references

Fixed point and Bregman iterative methods for matrix rank minimization

0 references

Error bounds and metric subregularity

0 references

Component selection and smoothing in multivariate nonparametric regression

0 references

On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization

0 references

Error bounds and convergence analysis of feasible descent methods: A general approach

0 references

On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization

0 references

The Group Lasso for Logistic Regression

0 references

Introductory lectures on convex optimization. A basic course.

0 references

Gradient methods for minimizing composite functions

0 references

Q5491447

0 references

Q3060974

0 references

Some continuity properties of polyhedral multifunctions

0 references

Convex Analysis

0 references

Calmness and Error Bounds for Convex Constraint Systems

0 references

Q3998482

0 references

Error Bounds for Linear Matrix Inequalities

0 references

Strong Semismoothness of Eigenvalues of Symmetric Matrices and Its Application to Inverse Eigenvalue Problems

0 references

Descent methods for convex essentially smooth minimization

0 references

A coordinate gradient descent method for nonsmooth separable minimization

0 references

Characterization of the subdifferential of some matrix norms

0 references

Coordinate descent algorithms

0 references

A Proximal-Gradient Homotopy Method for the Sparse Least-Squares Problem

0 references

Model Selection and Estimation in Regression with Grouped Variables

0 references

On the linear convergence of a proximal gradient method for a class of nonsmooth convex minimization problems

0 references

Metric Subregularity and Calmness for Nonconvex Generalized Equations in Banach Spaces

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1675267

@@ Property / cites work @@
+Convex multi-task feature learning
@@ Property / cites work: Convex multi-task feature learning / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Hoffman-type estimates in eigenvalue and semidefinite inequality constraints
+Normal rank
@@ Property / cites work @@
+On Projection Algorithms for Solving Convex Feasibility Problems
+Normal rank
@@ Property / cites work @@
+Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
+Normal rank
@@ Property / cites work @@
+A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
+Normal rank
@@ Property / cites work @@
+Signal Recovery by Proximal Forward-Backward Splitting
+Normal rank
@@ Property / cites work @@
+An introduction to a class of matrix cone programming
+Normal rank
@@ Property / cites work @@
+Implicit Functions and Solution Mappings
@@ Property / cites work: Implicit Functions and Solution Mappings / rank @@
+Normal rank
@@ Property / cites work @@
+Finite-Dimensional Variational Inequalities and Complementarity Problems
+Normal rank
@@ Property / cites work @@
+Local behavior of an iterative framework for generalized equations with nonisolated solutions
+Normal rank
@@ Property / cites work @@
+Recovering Low-Rank Matrices From Few Coefficients in Any Basis
+Normal rank
@@ Property / cites work @@
+Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
+Normal rank
@@ Property / cites work @@
+Approximation accuracy, gradient methods, and error bound for structured convex optimization
+Normal rank
@@ Property / cites work @@
+Fixed point and Bregman iterative methods for matrix rank minimization
+Normal rank
@@ Property / cites work @@
+Error bounds and metric subregularity
@@ Property / cites work: Error bounds and metric subregularity / rank @@
+Normal rank
@@ Property / cites work @@
+Component selection and smoothing in multivariate nonparametric regression
+Normal rank
@@ Property / cites work @@
+On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
+Normal rank
@@ Property / cites work @@
+Error bounds and convergence analysis of feasible descent methods: A general approach
+Normal rank
@@ Property / cites work @@
+On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization
+Normal rank
@@ Property / cites work @@
+The Group Lasso for Logistic Regression
@@ Property / cites work: The Group Lasso for Logistic Regression / rank @@
+Normal rank
@@ Property / cites work @@
+Introductory lectures on convex optimization. A basic course.
+Normal rank
@@ Property / cites work @@
+Gradient methods for minimizing composite functions
+Normal rank
@@ Property / cites work @@
+Q5491447
@@ Property / cites work: Q5491447 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3060974
@@ Property / cites work: Q3060974 / rank @@
+Normal rank
@@ Property / cites work @@
+Some continuity properties of polyhedral multifunctions
+Normal rank
@@ Property / cites work @@
+Convex Analysis
@@ Property / cites work: Convex Analysis / rank @@
+Normal rank
@@ Property / cites work @@
+Calmness and Error Bounds for Convex Constraint Systems
+Normal rank
@@ Property / cites work @@
+Q3998482
@@ Property / cites work: Q3998482 / rank @@
+Normal rank
@@ Property / cites work @@
+Error Bounds for Linear Matrix Inequalities
@@ Property / cites work: Error Bounds for Linear Matrix Inequalities / rank @@
+Normal rank
@@ Property / cites work @@
+Strong Semismoothness of Eigenvalues of Symmetric Matrices and Its Application to Inverse Eigenvalue Problems
+Normal rank
@@ Property / cites work @@
+Descent methods for convex essentially smooth minimization
+Normal rank
@@ Property / cites work @@
+A coordinate gradient descent method for nonsmooth separable minimization
+Normal rank
@@ Property / cites work @@
+Characterization of the subdifferential of some matrix norms
+Normal rank
@@ Property / cites work @@
+Coordinate descent algorithms
@@ Property / cites work: Coordinate descent algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+A Proximal-Gradient Homotopy Method for the Sparse Least-Squares Problem
+Normal rank
@@ Property / cites work @@
+Model Selection and Estimation in Regression with Grouped Variables
+Normal rank
@@ Property / cites work @@
+On the linear convergence of a proximal gradient method for a class of nonsmooth convex minimization problems
+Normal rank
@@ Property / cites work @@
+Metric Subregularity and Calmness for Nonconvex Generalized Equations in Banach Spaces
+Normal rank