An alternating direction method for solving convex nonlinear semidefinite programming problems
From MaRDI portal
Publication:2841143
DOI10.1080/02331934.2011.611883zbMath1282.65073OpenAlexW2011077684MaRDI QIDQ2841143
Su Zhang, James S. K. Ang, Jie Sun
Publication date: 24 July 2013
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/20.500.11937/45136
variational inequalitiesnumerical resultsmatrix completionalternating direction methodconvex semidefinite programming
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Convex programming (90C25) Matrix completion problems (15A83) Numerical methods for variational inequalities and related problems (65K15)
Related Items
On linear convergence of projected gradient method for a class of affine rank minimization problems, An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization Problems, A stabilized sequential quadratic semidefinite programming method for degenerate nonlinear semidefinite programs, A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints, A prediction-correction inexact alternating direction method for convex nonlinear second-order cone programming with linear constraints, A novel approach for solving semidefinite programs, Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming
Uses Software
Cites Work
- Unnamed Item
- Fixed point and Bregman iterative methods for matrix rank minimization
- A primal-dual interior point method for nonlinear semidefinite programming
- Successive linearization methods for nonlinear semidefinite programs
- A boundary point method to solve semidefinite programs
- The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
- Application of the alternating direction method of multipliers to separable convex programming problems
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Parallel alternating direction multiplier decomposition of convex programs
- On some interconnections between strict monotonicity, globally uniquely solvable, and \(P\) properties in semidefinite linear complementarity problems.
- Distance matrix completion by numerical optimization
- A new inexact alternating directions method for monotone variational inequalities
- An interior method for nonconvex semidefinite programs
- Alternating direction splittings for block angular parallel optimization
- Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods
- Spectral bundle methods for non-convex maximum eigenvalue functions: second-order methods
- Exact matrix completion via convex optimization
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- PENNON: A code for convex nonlinear and semidefinite programming
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Robust Control via Sequential Semidefinite Programming
- A Squared Smoothing Newton Method for Nonsmooth Matrix Equations and Its Applications in Semidefinite Optimization Problems
- A Global Algorithm for Nonlinear Semidefinite Programming
- An Interior Point Constrained Trust Region Method for a Special Class of Nonlinear Semidefinite Programming Problems
- A Multiple-Cut Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems
- Automorphism Invariance of P- and GUS-Properties of Linear Transformations on Euclidean Jordan Algebras
- Solving Lift-and-Project Relaxations of Binary Integer Programs
- An Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems
