SDPA - MaRDI portal

swMATH3275MaRDI QIDQ15807FDOQ15807

Author name not available (Why is that?)

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

The State-of-the-Art in Conic Optimization Software
A matrix-based IRLS algorithm for the least \(l_p\)-norm design of 2-D FIR filters
Sums of squares based approximation algorithms for MAX-SAT
Formal Proofs for Nonlinear Optimization
Title not available (Why is that?)
A sums-of-squares extension of policy iterations
Mixed linear and semidefinite programming for combinatorial and quadratic optimization
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
Polyhedral approximations of the semidefinite cone and their application
Robust synchronization analysis in nonlinear stochastic cellular networks with time-varying delays, intracellular perturbations and intercellular noise
Numerical algebraic geometry and semidefinite programming
How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization
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)
Constrained trace-optimization of polynomials in freely noncommuting variables
Abstract interpretation meets convex optimization
Exploiting Sparsity in SDP Relaxation of Polynomial Optimization Problems
Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm
High-Accuracy Semidefinite Programming Bounds for Kissing Numbers
Parallel implementation of successive convex relaxation methods for quadratic optimization problems
Solving large-scale semidefinite programs in parallel
A Maximum Likelihood Approach to Density Estimation with Semidefinite Programming
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
Monochromatic triangles in three-coloured graphs
Solving Natural Conic Formulations with Hypatia.jl
Complete solution for unambiguous discrimination of three pure states with real inner products
Semidefinite programming based approaches to the break minimization problem
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
Certified Roundoff Error Bounds Using Semidefinite Programming
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
Bounds for Deterministic and Stochastic Dynamical Systems using Sum-of-Squares Optimization
Approximating the Pareto set of multiobjective linear programs via robust optimization
Minimum Number of Monotone Subsequences of Length 4 in Permutations
Avoiding numerical cancellation in the interior point method for solving semidefinite programs
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
Implementation of a primal-dual method for SDP on a shared memory parallel architecture
Solving SDP completely with an interior point oracle
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
PENNON: Software for Linear and Nonlinear Matrix Inequalities
Positive semidefinite relaxations for distance geometry problems.
A robust Lagrangian-DNN method for a class of quadratic optimization problems
Title not available (Why is that?)
The tracial moment problem and trace-optimization of polynomials
Sums of squares in Macaulay2
Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools
A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
Minimizing the sum of many rational functions
Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs
Stronger linear programming relaxations of max-cut
Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
Sparsity in sums of squares of polynomials
Second order cone programming relaxation of nonconvex quadratic optimization problems
Computing sum of squares decompositions with rational coefficients
Algorithm 950: Ncpol2sdpa -- sparse semidefinite programming relaxations for polynomial optimization problems of noncommuting variables
Multi-scale robust design and optimization considering load uncertainties
A survey of graph edit distance
Kestrel: an interface from optimization modeling systems to the NEOS server
Fastest mixing Markov chain on graphs with symmetries
Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
Computational enhancements in low-rank semidefinite programming
NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials
Algorithm 925
Approximating optimization problems over convex functions
Semi-definite programming for topology optimization of trusses under multiple eigenvalue constraints
Semidefinite programming for discrete optimization and matrix completion problems
Parameter identification in financial market models with a feasible point SQP algorithm
A new approach for weighted constraint satisfaction
Constraints on 2d CFT partition functions
Solving nonconvex SDP problems of structural optimization with stability control
New Turán densities for 3-graphs
Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0
A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems
Facial reduction algorithms for conic optimization problems
Title not available (Why is that?)
Applications of semidefinite programming
Sums of squares, moment matrices and optimization over polynomials
A constraint-reduced algorithm for semidefinite optimization problems with superlinear convergence
Implementation of interior point methods for mixed semidefinite and second order cone optimization problems
SDPA PROJECT : SOLVING LARGE-SCALE SEMIDEFINITE PROGRAMS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
Group symmetry in interior-point methods for semidefinite program
Randomized heuristics for the Max-Cut problem
Confidence structural robust design and optimization under stiffness and load uncertainties

This page was built for software: SDPA