A semismooth Newton-based augmented Lagrangian algorithm for density matrix least squares problems
type: Item
instance of: scholarly article
title: A semismooth Newton-based augmented Lagrangian algorithm for density matrix least squares problems
author: Yanyan Li
published in: Journal of Optimization Theory and Applications
publication date: 2022-11-17T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C06
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 7618990
zbMATH Keywords: density matrix least squares problems
zbMATH Keywords: semismooth Newton algorithm
zbMATH Keywords: augmented Lagrangian algorithm
zbMATH Keywords: quadratic growth condition
describes a project that uses: QSDPNAL
describes a project that uses: SDPNAL+
MaRDI profile type: Publication
full work available at URL: s10957-022-02120-0
OpenAlex ID: W4307301388
cites work: Level-set methods for convex optimization
cites work: On Projection Algorithms for Solving Convex Feasibility Problems
cites work: First-Order Methods in Optimization
cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
cites work: Q5690490
cites work: The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates
cites work: Exact matrix completion via convex optimization
cites work: Phaselift: exact and stable signal recovery from magnitude measurements via convex programming
cites work: Matrix completion via an alternating direction method
cites work: Q3996569
cites work: Augmented Lagrangian methods for convex matrix optimization problems
cites work: On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming
cites work: Spectral operators of matrices
cites work: Spectral Operators of Matrices: Semismoothness and Characterizations of the Generalized Jacobian
cites work: Implicit Functions and Solution Mappings
cites work: On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
cites work: Finite-Dimensional Variational Inequalities and Complementarity Problems
cites work: Low-rank spectral optimization via gauge duality
cites work: Gauge Optimization and Duality
cites work: A dual algorithm for the solution of nonlinear variational problems via finite element approximation
cites work: Q4144736
cites work: Sparse Approximate Solutions to Semidefinite Programs
cites work: Validation of subgradient optimization
cites work: Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
cites work: Solving Nuclear Norm Regularized and Semidefinite Matrix Least Squares Problems with Linear Equality Constraints
cites work: Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
cites work: Derivatives of Spectral Functions
cites work: A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems
cites work: On Efficiently Solving the Subproblems of a Level-Set Method for Fused Lasso Problems
cites work: QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming
cites work: On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope
cites work: An efficient Hessian based algorithm for singly linearly and box constrained least squares regression
cites work: Efficient Sparse Semismooth Newton Methods for the Clustered Lasso Problem
cites work: Über monotone Matrixfunktionen
cites work: A simple characterization of solutions sets of convex programs
cites work: Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization
cites work: Semismooth and Semiconvex Functions in Constrained Optimization
cites work: Proximité et dualité dans un espace hilbertien
cites work: Q2706552
cites work: A second-order bundle method to minimize the maximum eigenvalue function.
cites work: An Accelerated Linearized Alternating Direction Method of Multipliers
cites work: Large-Scale Optimization of Eigenvalues
cites work: Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
cites work: Some continuity properties of polyhedral multifunctions
cites work: Convex Analysis
cites work: A nonsmooth version of Newton's method
cites work: Q3161693
cites work: Phase recovery, MaxCut and complex semidefinite programming
cites work: SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
cites work: Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
cites work: An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems
cites work: A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
DOI: 10.1007/S10957-022-02120-0
description: scientific article; zbMATH DE number 7618990