Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems
From MaRDI portal
Publication:2436689
DOI10.1007/s10589-013-9590-3zbMath1312.90052OpenAlexW1988690490MaRDI QIDQ2436689
Camilo Ortiz, Renato D. C. Monteiro, Benar Fux Svaiter
Publication date: 25 February 2014
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-013-9590-3
complexityconvex optimizationconic optimizationproximalsemidefinite programingextragradientblock-decomposition
Related Items
Douglas-Rachford splitting method for semidefinite programming, Conic optimization via operator splitting and homogeneous self-dual embedding, Accelerating Block-Decomposition First-Order Methods for Solving Composite Saddle-Point and Two-Player Nash Equilibrium Problems, Alternating direction method of multipliers for separable convex optimization of real functions in complex variables, A first-order block-decomposition method for solving two-easy-block structured semidefinite programs, On inexact relative-error hybrid proximal extragradient, forward-backward and Tseng's modified forward-backward methods with inertial effects, An equivalent nonlinear optimization model with triangular low-rank factorization for semidefinite programs, An inexact Spingarn's partial inverse method with applications to operator splitting and composite optimization, AAR-based decomposition algorithm for non-linear convex optimisation, On the convergence rate of the scaled proximal decomposition on the graph of a maximal monotone operator (SPDG) algorithm, A generalized alternating direction method of multipliers with semi-proximal terms for convex composite conic programming, Iteration complexity of an inexact Douglas-Rachford method and of a Douglas-Rachford-Tseng's F-B four-operator splitting method for solving monotone inclusions, A variant of the hybrid proximal extragradient method for solving strongly monotone inclusions and its complexity analysis
Uses Software
Cites Work
- Alternating direction augmented Lagrangian methods for semidefinite programming
- Copositive and semidefinite relaxations of the quadratic assignment problem
- A boundary point method to solve semidefinite programs
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Enlargement of monotone operators with applications to variational inequalities
- A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- Maximal monotone operators, convex functions and a special family of enlargements
- A first-order primal-dual algorithm for convex problems with applications to imaging
- On the maximal monotonicity of subdifferential mappings
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean
- Complexity of Variants of Tseng's Modified F-B Splitting and Korpelevich's Methods for Hemivariational Inequalities with Applications to Saddle-point and Convex Optimization Problems
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Regularization Methods for Semidefinite Programming
- Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers
- A family of enlargements of maximal monotone operators
- Benchmarking optimization software with performance profiles.
- Unnamed Item
- Unnamed Item
- Unnamed Item
