An Interior-Point Method for Semidefinite Programming
From MaRDI portal
Publication:4884041
DOI10.1137/0806020zbMath0853.65066MaRDI QIDQ4884041
Robert J. Vanderbei, Henry Wolkowicz, Franz Rendl, Christoph Helmberg
Publication date: 22 September 1996
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0806020
semidefinite programming; interior-point method; stable set problem; graph bisection problems; max-cut relaxations; max-min eigenvalue problems
Related Items
SDPT3 — A Matlab software package for semidefinite programming, Version 1.3, On homogeneous interrior-point algorithms for semidefinite programming, Implementation of interior point methods for mixed semidefinite and second order cone optimization problems, A study of search directions in primal-dual interior-point methods for semidefinite programming, On long-step predictor-corrector interior-point algorithm for semidefinite programming with Monteiro-Zhang unified search directions, Implementation of primal-dual methods for semidefinite programming based on Monteiro and Tsuchiya Newton directions and their variants, A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming, Sdpha: a Matlab implementation of homogeneous interior-point algorithms for semidefinite programming, CSDP, A C library for semidefinite programming, A solution method for combined semi-infinite and semi-definite programming, Three‐dimensional Mohr–Coulomb limit analysis using semidefinite programming, Global optimization in protein docking using clustering, underestimation and semidefinite programming, Semidefinite programming and combinatorial optimization, New complexity analysis of the primal-dual method for semidefinite optimization based on the Nesterov-Todd direction, A cutting plane algorithm for semi-definite programming problems with applications to failure discriminant analysis, Semidefinite programming for discrete optimization and matrix completion problems, The bounded smooth reformulation and a trust region algorithm for semidefinite complementarity problems, A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization, Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations, Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling, On the solution of large-scale SDP problems by the modified barrier method using iterative solvers, Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems, Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP, Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations, Inexact non-interior continuation method for solving large-scale monotone SDCP, On the long-step path-following method for semidefinite programming, Superlinear convergence of interior-point algorithms for semidefinite programming, A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming, Solving quadratic (0,1)-problems by semidefinite programs and cutting planes, Affine scaling algorithm fails for semidefinite programming, Polynomial primal-dual cone affine scaling for semidefinite programming, Symmetric primal-dual path-following algorithms for semidefinite programming, A long-step primal-dual path-following method for semidefinite programming, Incomplete orthogonalization preconditioners for solving large and dense linear systems which arise from semidefinite programming, Exploiting sparsity in primal-dual interior-point methods for semidefinite programming, Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs, Spectral methods for graph bisection problems., A primal-dual interior point method for parametric semidefinite programming problems, On a commutative class of search directions for linear programming over symmetric cones, Semidefinite programming, Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem, On self-regular IPMs (with comments and rejoinder), Strengthened existence and uniqueness conditions for search directions in semidefinite program\-ming, Bounds and fast approximation algorithms for binary quadratic optimzation problems with application to MAX 2SAT, An \(\epsilon\)-sensitivity analysis for semidefinite programming, Approximating the fixed linear crossing number, Equivalence of two nondegeneracy conditions for semidefinite programs, Local minima and convergence in low-rank semidefinite programming, Solving semidefinite programming problems via alternating direction methods, A relaxed cutting plane method for semi-infinite semi-definite programming, An efficient support vector machine learning method with second-order cone programming for large-scale problems, Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition, Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function, A conversion of an SDP having free variables into the standard form SDP, A continuation algorithm for max-cut problem, A team algorithm for robust stability analysis and control design of uncertain time-varying linear systems using piecewise quadratic Lyapunov functions, A projected gradient algorithm for solving the maxcut SDP relaxation, Feasible direction algorithm for solving the SDP relaxations of quadratic {−1, 1} programming problems, Knowledge-based semidefinite linear programming classifiers, PREDICTOR–CORRECTOR SMOOTHING NEWTON METHOD FOR SOLVING SEMIDEFINITE PROGRAMMING, A CONTINUATION APPROACH USING NCP FUNCTION FOR SOLVING MAX-CUT PROBLEM, Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp∗
