swMATH4333MaRDI QIDQ16512FDOQ16512
Author name not available (Why is that?)
Official website: http://www.cs.nyu.edu/faculty/overton/software/sdppack/sdppack.html
Cited In (65)
- A Derivation of Lovász' Theta via Augmented Lagrange Duality
- Title not available (Why is that?)
- On bounds for the existence of a bistable controller.
- Tighter linear and semidefinite relaxations for max-cut based on the Lovász-Schrijver lift-and-project procedure
- Interior point methods 25 years later
- Title not available (Why is that?)
- Extending Mehrotra and Gondzio higher order methods to mixed semidefinite-quadratic-linear programming
- Semi-definite positive programming relaxations for graph \(K_n\)-coloring in frequency assignment.
- Semidefinite programming for discrete optimization and matrix completion problems
- Title not available (Why is that?)
- Applications of second-order cone programming
- A tight semidefinite relaxation of the MAX CUT problem
- A new discrete filled function method for solving large scale max-cut problems
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
- Title not available (Why is that?)
- A predictive controller with artificial Lyapunov function for linear systems with input/state constraints
- Applications of semidefinite programming
- Further development of multiple centrality correctors for interior point methods
- Implementation of interior point methods for mixed semidefinite and second order cone optimization problems
- CSDP 2.3 user's guide
- CSDP, A C library for semidefinite programming
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Sdpha: a Matlab implementation of homogeneous interior-point algorithms for semidefinite programming
- SDPLIB 1.2, a library of semidefinite programming test problems
- Nonnegative minimum biased quadratic estimation in mixed linear models
- Topics in semidefinite and interior-point methods
- Incomplete orthogonalization preconditioners for solving large and dense linear systems which arise from semidefinite programming
- The Gauss-Newton direction in semidefinite programming
- A novel LMI-based optimization algorithm for the guaranteed estimation of the domain of attraction using rational Lyapunov functions
- Primal-Dual Interior-Point Methods for Semidefinite Programming in Finite Precision
- Nonsymmetric Search Directions for Semidefinite Programming
- CSDP
- SDPLIB
- Sdpsol
- SDPHA
- SOCP
- SDPA
- CirCut
- COL
- KYPD
- LMITOOL
- MAXDET
- Polynomial Toolbox
- Outward rotations
- SenSrivastava
- A continuation algorithm for max-cut problem
- Portfolio optimization with linear and fixed transaction costs
- Semidefinite and second-order cone optimization approach for the Toeplitz matrix approximation problem
- Sp
- QDES
- Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring
- Strengthened semidefinite programming relaxations for the max-cut problem.
- A new Lagrangian net algorithm for solving max-bisection problems
- Sufficient conditions for the synthesis ofH? fixed-order controllers
- Similarity and other spectral relations for symmetric cones
- Algorithmic and explicit determination of the Lovász number for certain circulant graphs
- A note on the calculation of step-lengths in interior-point methods for semidefinite programming
- A modified VNS metaheuristic for max-bisection problems
- A homotopy method based on penalty function for nonlinear semidefinite programming
- A homotopy method for nonlinear semidefinite programming
- Interior-Point Algorithms for Semidefinite Programming Problems Derived from the KYP Lemma
- Clique, chromatic, and Lovász numbers of certain circulant graphs
- Title not available (Why is that?)
- A successive quadratic programming algorithm for SDP relaxation of Max-Bisection
- Advances in Linear Matrix Inequality Methods in Control
This page was built for software: SDPpack
