Regularization Methods for Semidefinite Programming
From MaRDI portal
Publication:5189563
DOI10.1137/070704575zbMath1187.90219OpenAlexW2046866204MaRDI QIDQ5189563
Jérôme Malick, Angelika Wiegele, Janez Povh, Franz Rendl
Publication date: 17 March 2010
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/070704575
Semidefinite programming (90C22) Large-scale problems in mathematical programming (90C06) Methods of quasi-Newton type (90C53)
Related Items
An SDP-based approach for computing the stability number of a graph, An inexact smoothing method for the monotone complementarity problem over symmetric cones, SDP-based bounds for graph partition via extended ADMM, Douglas-Rachford splitting method for semidefinite programming, Matrix Relaxations in Combinatorial Optimization, A method for semidefinite quasiconvex maximization problem, An accelerated first-order method for solving SOS relaxations of unconstrained polynomial optimization problems, Semidefinite programming and sums of Hermitian squares of noncommutative polynomials, An alternating direction method for second-order conic programming, A boundary point method to solve semidefinite programs, An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem, New heuristics for the vertex coloring problem based on semidefinite programming, Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials, A trust region method for solving semidefinite programs, Alternating proximal gradient method for convex minimization, On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods, An alternating direction method for convex quadratic second-order cone programming with bounded constraints, Fast alternating linearization methods for minimizing the sum of two convex functions, Solving \(k\)-cluster problems to optimality with semidefinite programming, A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs, SDP-based branch-and-bound for non-convex quadratic integer optimization, A first-order block-decomposition method for solving two-easy-block structured semidefinite programs, On the stable solution of large scale problems over the doubly nonnegative cone, On a box-constrained linear symmetric cone optimization problem, Newton's method for computing the nearest correlation matrix with a simple upper bound, Alternating direction augmented Lagrangian methods for semidefinite programming, Nonsingularity of FB system and constraint nondegeneracy in semidefinite programming, Solving SDP relaxations of max-cut problem with large number of hypermetric inequalities by L-BFGS-B, The tracial moment problem and trace-optimization of polynomials, An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization, BiqBin: Moving Boundaries for NP-hard Problems by HPC, Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems, A globally convergent filter-type trust region method for semidefinite programming, Alternating Direction Methods for Latent Variable Gaussian Graphical Model Selection, Alternating direction method of multipliers for sparse principal component analysis, Lower bounds on the global minimum of a polynomial, On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming, An introduction to a class of matrix cone programming, A guide to conic optimisation and its applications, \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM, Improving ADMMs for solving doubly nonnegative programs through dual factorization, Numerical methods for solving some matrix feasibility problems, An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity, Inexact non-interior continuation method for monotone semidefinite complementarity problems, On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems, A feasible method for optimization with orthogonality constraints, Preprocessing and Regularization for Degenerate Semidefinite Programs, A survey on conic relaxations of optimal power flow problem, High-accuracy solution of large-scale semidefinite programs, A robust algorithm for semidefinite programming, Constrained trace-optimization of polynomials in freely noncommuting variables, Block Coordinate Descent Methods for Semidefinite Programming, Projection Methods in Conic Optimization, Efficient semidefinite branch-and-cut for MAP-MRF inference, Using a factored dual in augmented Lagrangian methods for semidefinite programming, Computational Methods for Solving Nonconvex Block-Separable Constrained Quadratic Problems, Chordal decomposition in operator-splitting methods for sparse semidefinite programs, A proximal augmented method for semidefinite programming problems, Erratum to: ``On the solution of large-scale SDP problems by the modified barrier method using iterative solvers, NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials, Convex optimization with an interpolation-based projection and its application to deep learning, A novel approach for solving semidefinite programs, Four algorithms to solve symmetric multi-type non-negative matrix tri-factorization problem
