SDPpack

swMATH4333MaRDI QIDQ16512

No author found.

Related Items (49)

Unnamed Item ⋮ Incomplete orthogonalization preconditioners for solving large and dense linear systems which arise from semidefinite programming ⋮ A Derivation of Lovász' Theta via Augmented Lagrange Duality ⋮ Algorithmic and explicit determination of the Lovász number for certain circulant graphs ⋮ A continuation algorithm for max-cut problem ⋮ 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 ⋮ Applications of second-order cone programming ⋮ Sufficient conditions for the synthesis ofH? fixed-order controllers ⋮ Topics in semidefinite and interior-point methods ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A new discrete filled function method for solving large scale max-cut problems ⋮ Interior point methods 25 years later ⋮ A tight semidefinite relaxation of the MAX CUT problem ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A successive quadratic programming algorithm for SDP relaxation of Max-Bisection ⋮ SDPT3 — A Matlab software package for semidefinite programming, Version 1.3 ⋮ A modified VNS metaheuristic for max-bisection problems ⋮ A homotopy method based on penalty function for nonlinear semidefinite programming ⋮ Unnamed Item ⋮ Portfolio optimization with linear and fixed transaction costs ⋮ Semidefinite programming for discrete optimization and matrix completion problems ⋮ A new Lagrangian net algorithm for solving max-bisection problems ⋮ Semi-Definite positive Programming Relaxations for Graph K_n-Coloring in Frequency Assignment ⋮ Implementation of interior point methods for mixed semidefinite and second order cone optimization problems ⋮ Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring ⋮ Tighter Linear and Semidefinite Relaxations for Max-Cut Based on the Lovász--Schrijver Lift-and-Project Procedure ⋮ Interior-Point Algorithms for Semidefinite Programming Problems Derived from the KYP Lemma ⋮ Primal-Dual Interior-Point Methods for Semidefinite Programming in Finite Precision ⋮ A note on the calculation of step-lengths in interior-point methods for semidefinite programming ⋮ Nonsymmetric Search Directions for Semidefinite Programming ⋮ Advances in Linear Matrix Inequality Methods in Control ⋮ Semidefinite and second-order cone optimization approach for the Toeplitz matrix approximation problem ⋮ Further development of multiple centrality correctors for interior point methods ⋮ Similarity and other spectral relations for symmetric cones ⋮ Applications of semidefinite programming ⋮ A predictive controller with artificial Lyapunov function for linear systems with input/state constraints ⋮ On bounds for the existence of a bistable controller. ⋮ Extending Mehrotra and Gondzio higher order methods to mixed semidefinite-quadratic-linear programming ⋮ 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 ⋮ Nonnegative minimum biased quadratic estimation in mixed linear models ⋮ Clique, chromatic, and Lovász numbers of certain circulant graphs ⋮ Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem ⋮ The Gauss-Newton direction in semidefinite programming

This page was built for software: SDPpack