A Semismooth Newton-based Augmented Lagrangian Algorithm for Density Matrix Least Squares Problems

No abstract is available for this paper.

• Publication year

  2022

• Venue

  Journal of Optimization Theory and Applications

• Publication date

  2022-10-26

• Fields of study

  Physics, Computer Science

• Identifiers
  DOI 10.1007/s10957-022-02120-0
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Augmented Lagrangian Methods for Convex Matrix Optimization Problems

  2021cited by this paper
• The High Order Augmented Finite Volume Methods Based on Series Expansion for Nonlinear Degenerate Parabolic Equations

  2021cited by this paper
• Quantum State Tomography as a Bilevel Problem, Utilizing I-Q Plane Data

  2021cited by this paper
• An Efficient Hessian Based Algorithm for Singly Linearly and Box Constrained Least Squares Regression

  2021cited by this paper
• The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates

  2018cited by this paper
• Efficient Sparse Semismooth Newton Methods for the Clustered Lasso Problem

  2018cited by this paper
• Provable compressed sensing quantum state tomography via non-convex methods

  2018cited by this paper
• Spectral Operators of Matrices: Semismoothness and Characterizations of the Generalized Jacobian

  2018influential reference
• On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming

  2017cited by this paper
• On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope

  2017cited by this paper
• On Efficiently Solving the Subproblems of a Level-Set Method for Fused Lasso Problems

  2017cited by this paper
• An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems

  2017cited by this paper
• First-Order Methods in Optimization

  2017cited by this paper
• A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems

  2016cited by this paper
• On the Asymptotic Superlinear Convergence of the Augmented Lagrangian Method for Semidefinite Programming with Multiple Solutions

  2016cited by this paper
• Level-set methods for convex optimization

  2016cited by this paper
• Low-Rank Spectral Optimization via Gauge Duality

  2015influential reference
• QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming

  2015influential reference
• An Accelerated Linearized Alternating Direction Method of Multipliers

  2014cited by this paper
• SDPNAL$$+$$+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints

  2014cited by this paper
• Spectral operators of matrices

  2014influential reference
• Gauge Optimization and Duality

  2013cited by this paper
• Solving Nuclear Norm Regularized and Semidefinite Matrix Least Squares Problems with Linear Equality Constraints

  2013cited by this paper
• Quantum Computation and Quantum Information

  2012cited by this paper
• Matrix completion via an alternating direction method

  2012cited by this paper
• AN INTRODUCTION TO A CLASS OF MATRIX OPTIMIZATION PROBLEMS

  2012influential reference
• Phase recovery, MaxCut and complex semidefinite programming

  2012cited by this paper
• PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming

  2011cited by this paper
• A Newton-CG Augmented Lagrangian Method for Semidefinite Programming

  2010cited by this paper
• Implicit Functions and Solution Mappings

  2009cited by this paper
• Alternating Direction Algorithms for 1-Problems in Compressive Sensing

  2009cited by this paper
• An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems

  2009influential reference
• Sparse Approximate Solutions to Semidefinite Programs

  2008cited by this paper
• Exact Matrix Completion via Convex Optimization

  2008cited by this paper
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization

  2007cited by this paper
• Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization

  2005cited by this paper
• Finite-Dimensional Variational Inequalities and Complementarity Problems

  2003influential reference
• A rank minimization heuristic with application to minimum order system approximation

  2001cited by this paper
• A second-order bundle method to minimize the maximum eigenvalue function

  2000cited by this paper
• Practical Aspects of the Moreau-Yosida Regularization: Theoretical Preliminaries

  1997cited by this paper
• On Projection Algorithms for Solving Convex Feasibility Problems

  1996influential reference
• Derivatives of Spectral Functions

  1996influential reference
• A nonsmooth version of Newton's method

  1993cited by this paper
• On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operators

  1992cited by this paper
• Large-Scale Optimization of Eigenvalues

  1990cited by this paper
• A simple characterization of solution sets of convex programs

  1988cited by this paper
• Matrix analysis

  1985influential reference
• Generalized Hessian matrix and second-order optimality conditions for problems withC1,1 data

  1984influential reference
• Optimization And Nonsmooth Analysis

  1983influential reference
• Some continuity properties of polyhedral multifunctions

  1981cited by this paper
• Semismooth and Semiconvex Functions in Constrained Optimization

  1977cited by this paper
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation

  1976cited by this paper
• Sur l'approximation, par éléments finis d'ordre un, et la résolution, par pénalisation-dualité d'une classe de problèmes de Dirichlet non linéaires

  1975cited by this paper
• Validation of subgradient optimization

  1974cited by this paper
• Convex Analysis: (pms-28)

  1970influential reference
• Proximité et dualité dans un espace hilbertien

  1965cited by this paper
• Über monotone Matrixfunktionen

  1934cited by this paper

• A Semismooth Newton-Based Augmented Lagrangian Algorithm for the Generalized Convex Nearly Isotonic Regression Problem

  2025cites this paper
• A semismooth Newton based augmented Lagrangian algorithm for Lovász theta SDP problem

  2025cites this paper
• An efficient algorithm for Fantope-constrained sparse principal subspace estimation problem

  2024cites this paper
• A semismooth Newton based dual proximal point algorithm for maximum eigenvalue problem

  2023cites this paper