Augmented Lagrangian methods for convex matrix optimization problems
From MaRDI portal
Publication:2158112
DOI10.1007/s40305-021-00346-9OpenAlexW3165423464MaRDI QIDQ2158112
Chao Ding, Ying Cui, Xinyuan Zhao, Xudong Li
Publication date: 22 July 2022
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-021-00346-9
spectral functionsaugmented Lagrangian methodssemismooth Newton methodsmatrix optimizationmetric subregularityfast convergence ratesquadratic growth conditions
Numerical mathematical programming methods (65K05) Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31)
Related Items
A semismooth Newton based dual proximal point algorithm for maximum eigenvalue problem, Nonsmooth dynamic analysis of rigid-flexible interaction collision, A semismooth Newton-based augmented Lagrangian algorithm for density matrix least squares problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A rank-corrected procedure for matrix completion with fixed basis coefficients
- An LP-Newton method: nonsmooth equations, KKT systems, and nonisolated solutions
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
- Higher-order metric subregularity and its applications
- The augmented Lagrangian method for equality and inequality constraints in Hilbert spaces
- The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
- On metric and calmness qualification conditions in subdifferential calculus
- Error bounds: necessary and sufficient conditions
- Metric subregularity and the proximal point method
- A simple characterization of solutions sets of convex programs
- Error bounds and convergence analysis of feasible descent methods: A general approach
- On matrix approximation problems with Ky Fan \(k\) norms
- Extended convergence results for the method of multipliers for nonstrictly binding inequality constraints
- Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices
- Solution of monotone complementarity problems with locally Lipschitzian functions
- Use of augmented Lagrangian methods for the optimal control of obstacle problems
- Local behavior of an iterative framework for generalized equations with nonisolated solutions
- Upper Lipschitz behavior of solutions to perturbed \(C^{1,1}\) programs
- Critical multipliers in variational systems via second-order generalized differentiation
- A unified approach to error bounds for structured convex optimization problems
- QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- Permeability estimation with the augmented Lagrangian method for a nonlinear diffusion equation
- On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming
- Variational analysis of the Ky Fan \(k\)-norm
- Spectral operators of matrices
- A note on upper Lipschitz stability, error bounds, and critical multipliers for Lipschitz-continuous KKT systems
- Noisy low-rank matrix completion with general sampling distribution
- An introduction to a class of matrix cone programming
- Multiplier and gradient methods
- Exact matrix completion via convex optimization
- On Lipschitzian Properties of Implicit Multifunctions
- Solving Nuclear Norm Regularized and Semidefinite Matrix Least Squares Problems with Linear Equality Constraints
- Local Convergence of Exact and Inexact Augmented Lagrangian Methods under the Second-Order Sufficient Optimality Condition
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- First Order and Second Order Characterizations of Metric Subregularity and Calmness of Constraint Set Mappings
- Asymptotic Convergence Analysis of the Proximal Point Algorithm
- Implicit Functions and Solution Mappings
- Fastest Mixing Markov Chain on Graphs with Symmetries
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Optimization and nonsmooth analysis
- Some continuity properties of polyhedral multifunctions
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- The Chebyshev Polynomials of a Matrix
- GMRES/CR and Arnoldi/Lanczos as Matrix Approximation Problems
- Variational Analysis
- Quadratic Growth Conditions for Convex Matrix Optimization Problems Associated with Spectral Functions
- On Projection Algorithms for Solving Convex Feasibility Problems
- Convex Analysis on the Hermitian Matrices
- Semidefinite Programming
- Convergence Properties of an Augmented Lagrangian Algorithm for Optimization with a Combination of General Equality and Linear Constraints
- Hölder Metric Subregularity with Applications to Proximal Point Method
- Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- On Directional Metric Subregularity and Second-Order Optimality Conditions for a Class of Nonsmooth Mathematical Programs
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
- Restricted strong convexity and weighted matrix completion: Optimal bounds with noise
- Metric subregularity of the convex subdifferential in Banach spaces
- Fastest Mixing Markov Chain on a Path
- Convex Analysis
- Semismooth Matrix-Valued Functions
- Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity
- Semismooth Homeomorphisms and Strong Stability of Semidefinite and Lorentz Complementarity Problems
- Some Properties of the Augmented Lagrangian in Cone Constrained Optimization
- A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions
- A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems
