SDPA

swMATH3275MaRDI QIDQ15807FDOQ15807

Author name not available (Why is that?)

Official website: https://sdpa.sourceforge.net/

Cited In (only showing first 100 items - show all)

• A matrix-based IRLS algorithm for the least \(l_p\)-norm design of 2-D FIR filters
• Formal Proofs for Nonlinear Optimization
• Title not available (Why is that?)
• Exploiting sparsity in SDP relaxation of polynomial optimization problems
• A sums-of-squares extension of policy iterations
• Generalized self-concordant functions: a recipe for Newton-type methods
• A cutting plane algorithm for semi-definite programming problems with applications to failure discriminant analysis
• Loop equations and bootstrap methods in the lattice
• The \( \mathcal{N}=2 \) superconformal bootstrap
• On verified numerical computations in convex programming
• Numerical algebraic geometry and semidefinite programming
• On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems
• Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods
• On the estimation of robustness and filtering ability of dynamic biochemical networks under process delays, internal parametric perturbations and external disturbances
• SOLVING LARGE SCALE OPTIMIZATION PROBLEMS VIA GRID AND CLUSTER COMPUTING(<Special Issue>Network Design, Control and Optimization)
• Certified roundoff error bounds using semidefinite programming
• Constrained trace-optimization of polynomials in freely noncommuting variables
• Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm
• Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization
• Parallel implementation of successive convex relaxation methods for quadratic optimization problems
• Application of facial reduction to \(H_\infty\) state feedback control problem
• Solving large-scale semidefinite programs in parallel
• Perturbation analysis of singular semidefinite programs and its applications to control problems
• On exact Reznick, Hilbert-Artin and Putinar's representations
• Performance of convex underestimators in a branch-and-bound framework
• Algorithmic Applications in Management
• A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming
• A non-linear arithmetic procedure for control-command software verification
• Incomplete orthogonalization preconditioners for solving large and dense linear systems which arise from semidefinite programming
• Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems
• Solving Natural Conic Formulations with Hypatia.jl
• Complete solution for unambiguous discrimination of three pure states with real inner products
• Title not available (Why is that?)
• Stochastic Linear-Quadratic Control via Primal-Dual Semidefinite Programming
• A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming
• A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with general irreducible components
• Sequential semidefinite programming for optimization of framed structures under multimodal buckling constraints
• Semidefinite and second-order cone optimization approach for the Toeplitz matrix approximation problem
• Preprocessing sparse semidefinite programs via matrix completion
• Primal-dual affine-scaling algorithms fail for semidefinite programming
• Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
• Parallel implementation of a semidefinite programming solver based on CSDP on a distributed memory cluster
• Bounds on heat transport for convection driven by internal heating
• Solving polynomial least squares problems via semidefinite programming relaxations
• PENNON: software for linear and nonlinear matrix inequalities
• In SDP Relaxations, Inaccurate Solvers Do Robust Optimization
• Hypatia.jl
• Efficient semidefinite programming with approximate ADMM
• A NEW SECOND-ORDER CONE PROGRAMMING RELAXATION FOR MAX-CUT PROBLEMS
• Lagrangian Dual Interior-Point Methods for Semidefinite Programs
• Bounds for deterministic and stochastic dynamical systems using sum-of-squares optimization
• A paradox in bosonic energy computations via semidefinite programming relaxations
• Sums of squares in Macaulay2
• Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools
• Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs
• Algorithm 950: Ncpol2sdpa -- sparse semidefinite programming relaxations for polynomial optimization problems of noncommuting variables
• Kestrel: an interface from optimization modeling systems to the NEOS server
• NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials
• Implementation of interior point methods for mixed semidefinite and second order cone optimization problems
• CSDP, A C library for semidefinite programming
• PENNON: A code for convex nonlinear and semidefinite programming
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• SDPLIB 1.2, a library of semidefinite programming test problems
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
• QAPLIB
• RAGlib
• Sdpsol
• Title not available (Why is that?)
• SeDuMi
• SDPT3
• VSDP
• GloptiPoly
• DSDP5
• Benchmarks for Optimization Software
• Mosek
• CirCut
• COL
• SDPLR
• SFSDP
• reducedLP
• YALMIP
• SPOOLES
• ConicBundle
• SparseCoLO
• FIR toolbox
• LMITOOL
• MAXDET
• PENSDP
• rMPC
• csminwel
• NMTR
• lambda
• PENLAB
• COMPleib
• PICOS
• Flagmatic
• NCSOStools
• SpeeDP
• Algorithm 996

This page was built for software: SDPA