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