A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs
From MaRDI portal
Publication:613430
DOI10.1016/j.ejor.2010.07.020zbMath1229.90119OpenAlexW1994777396MaRDI QIDQ613430
Publication date: 20 December 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.07.020
Related Items
A proximal quadratic surface support vector machine for semi-supervised binary classification ⋮ A method for weighted projections to the positive definite cone ⋮ An alternating direction method for second-order conic programming ⋮ Unnamed Item ⋮ An alternating direction method for convex quadratic second-order cone programming with bounded constraints ⋮ An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization Problems ⋮ A new parallel splitting descent method for structured variational inequalities ⋮ A parallel splitting method for separable convex programs ⋮ A note on the alternating direction method of multipliers ⋮ A proximal fully parallel splitting method with a relaxation factor for separable convex programming ⋮ \(O(1/t)\) complexity analysis of the generalized alternating direction method of multipliers ⋮ Proximal alternating direction-based contraction methods for separable linearly constrained convex optimization ⋮ An ADM-based splitting method for separable convex programming ⋮ Splitting and linearizing augmented Lagrangian algorithm for subspace recovery from corrupted observations ⋮ Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming ⋮ Alternating direction method for bi-quadratic programming ⋮ Modified alternating direction methods for the modified multiple-sets split feasibility problems ⋮ A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints ⋮ A class of linearized proximal alternating direction methods ⋮ On Glowinski's open question on the alternating direction method of multipliers ⋮ QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming ⋮ Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization ⋮ An inexact spectral bundle method for convex quadratic semidefinite programming ⋮ Solving policy design problems: alternating direction method of multipliers-based methods for structured inverse variational inequalities ⋮ A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions ⋮ Projection Methods in Conic Optimization ⋮ Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach ⋮ A prediction-correction inexact alternating direction method for convex nonlinear second-order cone programming with linear constraints ⋮ An alternating direction-based contraction method for linearly constrained separable convex programming problems ⋮ Computing the Best Approximation over the Intersection of a Polyhedral Set and the Doubly Nonnegative Cone ⋮ Convergence study of indefinite proximal ADMM with a relaxation factor ⋮ A novel approach for solving semidefinite programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Computing the nearest correlation matrix--a problem from finance
- The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
- An inexact primal-dual path following algorithm for convex quadratic SDP
- On filter-successive linearization methods for nonlinear semidefinite programming
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A proximal-based deomposition method for compositions method for convex minimization problems
- A new inexact alternating directions method for monotone variational inequalities
- Solving semidefinite programming problems via alternating direction methods
- A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
- Calibrating Least Squares Semidefinite Programming with Equality and Inequality Constraints
- A Dual Approach to Semidefinite Least-Squares Problems
- A Squared Smoothing Newton Method for Nonsmooth Matrix Equations and Its Applications in Semidefinite Optimization Problems
- Inexact Newton methods for the nonlinear complementarity problem
- Regularization Methods for Semidefinite Programming
- Quadratic Matrix Programming
- Fast Algorithms for Projection on an Ellipsoid
- Least-Squares Covariance Matrix Adjustment
- A predictor--corrector algorithm for QSDP combining Dikin-type and Newton centering steps
