Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
From MaRDI portal
Publication:4764307
DOI10.1137/0805002zbMATH Open0833.90087OpenAlexW1963753244MaRDI QIDQ4764307FDOQ4764307
Authors: Farid Alizadeh 
Publication date: 4 May 1995
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/0c876ce34855898bbd57200ae28154343e2fe00e
Recommendations
interior point methodssemidefinite programmingmaximum cliqueeigenvalue optimizationmaximum stable setperfect graphslinear equality constraintsclassical cone duality
Convex programming (90C25) Linear programming (90C05) Programming involving graphs or networks (90C35) Eigenvalues, singular values, and eigenvectors (15A18) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Integer programming (90C10)
Cited In (only showing first 100 items - show all)
- A New Relaxation in Conic Form for the Euclidean Steiner Problem in ℜ
- Return-mapping algorithms for associative isotropic hardening plasticity using conic optimization
- On the efficiency of influence-and-exploit strategies for revenue maximization under positive externalities
- Semidefinite optimization estimating bounds on linear functionals defined on solutions of linear ODEs
- A semidefinite hierarchy for containment of spectrahedra
- A modified infeasible interior-point algorithm with full-Newton step for semidefinite optimization
- An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming
- Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: Newton's system of equations
- A new wide-neighborhood predictor-corrector interior-point method for semidefinite optimization
- Numerical algebraic geometry and semidefinite programming
- Semidefinite programming and matrix scaling over the semidefinite cone.
- Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence
- DC formulations and algorithms for sparse optimization problems
- New abilities and limitations of spectral graph bisection
- Best ellipsoidal relaxation to solve a nonconvex problem.
- Indefinite stochastic LQ control with cross term via semidefinite programming
- An efficient parameterized logarithmic kernel function for semidefinite optimization
- A survey on conic relaxations of optimal power flow problem
- An interior point method for solving semidefinite programs using cutting planes and weighted analytic centers
- A second-order cone based approach for solving the trust-region subproblem and its variants
- Infeasible interior point method for semidefinite programs
- On self-regular IPMs (with comments and rejoinder)
- Corrector-predictor interior-point method with new search direction for semidefinite optimization
- A sequential quadratic penalty method for nonlinear semidefinite programming
- A new proof of the strong duality theorem for semidefinite programming
- A unified class of directly solvable semidefinite programming problems
- A performance guaranteed sampled-data event-triggered consensus approach for linear multi-agent systems
- A polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite optimization
- A solution method for combined semi-infinite and semi-definite programming
- Computation of the distance to semi-algebraic sets
- PCA Sparsified
- On the identification of the optimal partition for semidefinite optimization
- An introduction to formally real Jordan algebras and their applications in optimization
- Low-order penalty equations for semidefinite linear complementarity problems
- An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood
- On the Turing model complexity of interior point methods for semidefinite programming
- Nonsingularity of FB system and constraint nondegeneracy in semidefinite programming
- A second-order corrector infeasible interior-point method for semidefinite optimization based on a wide neighborhood
- A primal-dual regularized interior-point method for semidefinite programming
- A new wide neighbourhood primal-dual interior-point algorithm for semidefinite optimization
- A Mehrotra predictor-corrector interior-point algorithm for semidefinite optimization
- Decomposed structured subsets for semidefinite and sum-of-squares optimization
- Remarks on some properties of conic yield restrictions in limit analysis
- SOS is not obviously automatizable, even approximately
- Scalable semidefinite programming
- Sublinear-time quadratic minimization via spectral decomposition of matrices
- COSMO: a conic operator splitting method for convex conic problems
- Inexact SA method for constrained stochastic convex SDP and application in Chinese stock market
- A novel neural network for solving semidefinite programming problems with some applications
- On the extension of an arc-search interior-point algorithm for semidefinite optimization
- New complexity analysis of a Mehrotra-type predictor-corrector algorithm for semidefinite programming
- Title not available (Why is that?)
- A second order Mehrotra-type predictor-corrector algorithm for semidefinite optimization
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
- Analyticity of the central path at the boundary point in semidefinite programming
- The Maximum k-Colorable Subgraph Problem and Related Problems
- Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step
- Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra
- Sparse PCA: convex relaxations, algorithms and applications
- Primal-dual interior-point algorithm for convex quadratic semi-definite optimization
- Cuts for mixed 0-1 conic programming
- Sparse Approximate Solutions to Semidefinite Programs
- A class of polynomial volumetric barrier decomposition algorithms for stochastic semidefinite programming
- Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
- Semidefinite programming relaxations for the graph partitioning problem
- Extending Mehrotra and Gondzio higher order methods to mixed semidefinite-quadratic-linear programming
- Semi-definite programming techniques for structured quadratic inverse eigenvalue problems
- The omnipresence of Lagrange
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
- Semidefinite programming for discrete optimization and matrix completion problems
- Optimality theorems for convex semidefinite vector optimization problems
- Detection of Lines by Combinatorial Optimization
- Towards non-symmetric conic optimization
- A logarithm barrier method for semi-definite programming
- A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function
- A sequential quadratic penalty method for nonlinear semidefinite programming
- Douglas-Rachford splitting method for semidefinite programming
- Stochastic semidefinite programming: a new paradigm for stochastic optimization
- New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph
- Reformulations in Mathematical Programming: Definitions and Systematics
- Applications of semidefinite programming
- A quantum characterization of NP
- A Maximum Likelihood Approach to Density Estimation with Semidefinite Programming
- A linear-time algorithm for trust region problems
- Semidefinite programming in combinatorial optimization
- Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
- A quadratic semidefinite relaxation approach for resource allocation in orthogonal frequency division multiple access
- Implementation of interior point methods for mixed semidefinite and second order cone optimization problems
- Full-Newton step infeasible interior-point algorithm for SDO problems
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- SDPLIB 1.2, a library of semidefinite programming test problems
- Symmetric primal-dual path-following algorithms for semidefinite programming
- New complexity analysis of a full Nesterov-Todd step interior-point method for semidefinite optimization
- An inexact non-interior continuation method for semidefinite programming: convergence analysis and numerical results
- Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
- Topics in semidefinite and interior-point methods
- An interior point constraint generation algorithm for semi-infinite optimization with health-care application
- A second-order mehrotra-type predictor-corrector algorithm with a new wide neighbourhood for semi-definite programming
- Credible autocoding of convex optimization algorithms
This page was built for publication: Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4764307)
