Quadratic growth conditions for convex matrix optimization problems associated with spectral functions
From MaRDI portal
Abstract: In this paper, we provide two types of sufficient conditions for ensuring the quadratic growth conditions of a class of constrained convex symmetric and non-symmetric matrix optimization problems regularized by nonsmooth spectral functions. These sufficient conditions are derived via the study of the -cone reducibility of spectral functions and the metric subregularity of their subdifferentials, respectively. As an application, we demonstrate how quadratic growth conditions are used to guarantee the desirable fast convergence rates of the augmented Lagrangian methods (ALM) for solving convex matrix optimization problems. Numerical experiments on an easy-to-implement ALM applied to the fastest mixing Markov chain problem are also presented to illustrate the significance of the obtained results.
Recommendations
- Augmented Lagrangian methods for convex matrix optimization problems
- On global quadratic growth condition for min-max optimization problems with quadratic functions
- The restricted strong convexity revisited: analysis of equivalence to error bound and quadratic growth
- scientific article; zbMATH DE number 823370
- Convergence Rate of an Optimization Algorithm for Minimizing Quadratic Functions with Separable Convex Constraints
Cites work
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A Newton-CG augmented Lagrangian method for semidefinite programming
- A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems
- A simple characterization of solutions sets of convex programs
- A unified approach to error bounds for structured convex optimization problems
- An introduction to a class of matrix cone programming
- An LP-Newton method: nonsmooth equations, KKT systems, and nonisolated solutions
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Asymptotic Convergence Analysis of the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Characterization of metric regularity of subdifferentials
- Characterization of the subdifferential of some matrix norms
- Convex Analysis
- Convex Analysis on the Hermitian Matrices
- Derivatives of Spectral Functions
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Error bounds: necessary and sufficient conditions
- Exact matrix completion via convex optimization
- Fastest Mixing Markov Chain on a Path
- Fastest mixing Markov chain on graphs with symmetries
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- First order and second order characterizations of metric subregularity and calmness of constraint set mappings
- First Order Conditions for General Nonlinear Optimization
- GMRES/CR and Arnoldi/Lanczos as Matrix Approximation Problems
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Higher-order metric subregularity and its applications
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- scientific article; zbMATH DE number 823379 (Why is no real title available?)
- Hölder metric subregularity with applications to proximal point method
- Implicit Functions and Solution Mappings
- Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming
- Local behavior of an iterative framework for generalized equations with nonisolated solutions
- Metric subregularity and the proximal point method
- Metric subregularity of the convex subdifferential in Banach spaces
- Monotone Operators and the Proximal Point Algorithm
- On directional metric subregularity and second-order optimality conditions for a class of nonsmooth mathematical programs
- On Lipschitzian properties of implicit multifunctions
- On matrix approximation problems with Ky Fan \(k\) norms
- On metric and calmness qualification conditions in subdifferential calculus
- On Projection Algorithms for Solving Convex Feasibility Problems
- Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices
- QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- Semidefinite Programming
- Semismooth Matrix-Valued Functions
- Sensitivity analysis of generalized equations
- Solution of monotone complementarity problems with locally Lipschitzian functions
- Solving nuclear norm regularized and semidefinite matrix least squares problems with linear equality constraints
- Some continuity properties of polyhedral multifunctions
- Stability analysis for composite optimization problems and parametric variational systems
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- Strong Semismoothness of Eigenvalues of Symmetric Matrices and Its Application to Inverse Eigenvalue Problems
- The Chebyshev Polynomials of a Matrix
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
- Variational Analysis
- Variational analysis of the Ky Fan k-norm
Cited in
(18)- Augmented Lagrangian methods for convex matrix optimization problems
- Kurdyka-Łojasiewicz exponent via inf-projection
- Metric subregularity and/or calmness of the normal cone mapping to the \(p\)-order conic constraint system
- On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming
- Quadratic growth conditions and uniqueness of optimal solution to Lasso
- scientific article; zbMATH DE number 823370 (Why is no real title available?)
- An inexact augmented Lagrangian method for second-order cone programming with applications
- Critical Multipliers in Semidefinite Programming
- Spectral operators of matrices: semismoothness and characterizations of the generalized Jacobian
- On degenerate doubly nonnegative projection problems
- Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem
- Strong Variational Sufficiency for Nonlinear Semidefinite Programming and Its Implications
- Local convergence analysis of augmented Lagrangian method for nonlinear semidefinite programming
- Variational analysis of orthogonally invariant norm cones of symmetric matrices
- Tilt stability of Ky-Fan -norm composite optimization
- Solution uniqueness of convex optimization problems via the radial cone
- Geometric characterizations of Lipschitz stability for convex optimization problems
- Twice epi-differentiability of orthogonally invariant matrix functions and application
This page was built for publication: Quadratic growth conditions for convex matrix optimization problems associated with spectral functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4588864)
