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 novel approach for solving semidefinite programs
- Implementation of primal-dual methods for semidefinite programming based on Monteiro and Tsuchiya Newton directions and their variants
- A new primal-dual path-following interior-point algorithm for semidefinite optimization
- Monte Carlo Algorithms for the Detection of Necessary Linear Matrix Inequality Constraints
- Optimality criteria without constraint qualifications for linear semidefinite problems
- An exact semidefinite programming approach for the max-mean dispersion problem
- Iterated linear optimization
- Mathematical programming models and exact algorithms
- Affine scaling algorithm fails for semidefinite programming
- Semi-definite relaxation algorithm of multiple knapsack problem
- On the connections between semidefinite optimization and vector optimization
- A new barrier for a class of semidefinite problems
- Penalty/Barrier multiplier algorthm for semidefinit programming∗
- The bounded smooth reformulation and a trust region algorithm for semidefinite complementarity problems
- Properties of the augmented Lagrangian in nonlinear semidefinite optimization
- Title not available (Why is that?)
- Central paths in semidefinite programming, generalized proximal-point method and Cauchy trajectories in Riemannian manifolds
- Heuristics for semirandom graph problems
- A new second-order corrector interior-point algorithm for semidefinite programming
- A max-cut approach to heterogeneity in cryo-electron microscopy
- Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term
- Random Laplacian matrices and convex relaxations
- Cuts, matrix completions and graph rigidity
- An interior-point method for approximate positive semidefinite completions
- Graph rigidity via Euclidean distance matrices
- An admissible dual internal point method for a linear semidefinite programming problem
- Role of redundant constraints for improving dual bounds in polynomial optimization problems
- On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs
- A long-step primal-dual path-following method for semidefinite programming
- Title not available (Why is that?)
- \(\ell ^2_2\) spreading metrics for vertex ordering problems
- Polynomial time solvability of non-symmetric semidefinite programming
- On global optimization with indefinite quadratics
- Identifying redundant linear constraints in systems of linear matrix inequality constraints
- Bandgap optimization of two-dimensional photonic crystals using semidefinite programming and subspace methods
- Semidefinite programming and combinatorial optimization
- Distance metric learning by minimal distance maximization
- A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization
- On the behavior of the homogeneous self-dual model for conic convex optimization
- Algorithmic and explicit determination of the Lovász number for certain circulant graphs
- Approximation algorithms for maximum cut with limited unbalance
- The \(Q\) method for symmetric cone programming
- Discretization method for semi-definite programming
- \(\mathcal{UV}\)-theory of a class of semidefinite programming and its applications
- Self-regular interior-point methods for semidefinite optimization
- Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem
- Computing maximin efficient experimental designs using the methods of semidefinite programming
- Interior-Point Algorithms for Semidefinite Programming Problems Derived from the KYP Lemma
- Polynomial primal-dual cone affine scaling for semidefinite programming
- An efficient semidefinite programming relaxation for the graph partition problem
- Complexity aspects of local minima and related notions
- Title not available (Why is that?)
- A wide neighbourhood interior-point method with iteration-complexity bound for semidefinite programming
- Solving SDP completely with an interior point oracle
- Exploiting semidefinite relaxations in constraint programming
- Semidefinite programming relaxations and algebraic optimization in control
- Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts
- Semidefinite programming and eigenvalue bounds for the graph partition problem
- An \(O(\sqrt nL)\) wide neighborhood interior-point algorithm for semidefinite optimization
- 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
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)
