SDPA
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Monotonicity of primal–dual interior-point algorithms for semidefinite programming problems
- A paradox in bosonic energy computations via semidefinite programming relaxations
- Positive semidefinite relaxations for distance geometry problems.
- Sums of squares based approximation algorithms for MAX-SAT
- A matrix-based IRLS algorithm for the least \(l_p\)-norm design of 2-D FIR filters
- scientific article; zbMATH DE number 1862745 (Why is no real title available?)
- A framework for solving mixed-integer semidefinite programs
- The tracial moment problem and trace-optimization of polynomials
- Sums of squares in Macaulay2
- Formal Proofs for Nonlinear Optimization
- 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
- Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools
- scientific article; zbMATH DE number 1664574 (Why is no real title available?)
- Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs
- Exploiting sparsity in SDP relaxation of polynomial optimization problems
- A sums-of-squares extension of policy iterations
- Stronger linear programming relaxations of max-cut
- A cutting plane algorithm for semi-definite programming problems with applications to failure discriminant analysis
- Generalized self-concordant functions: a recipe for Newton-type methods
- Sparsity in sums of squares of polynomials
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- Mixed linear and semidefinite programming for combinatorial and quadratic optimization
- Loop equations and bootstrap methods in the lattice
- Continuous and discrete mathematics for optimization. Proceedings of a symposium held at the Research Institute for Mathematical Sciences, Kyoto University, Kyoto, Japan, July 14--16, 1999
- Second order cone programming relaxation of nonconvex quadratic optimization problems
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Multi-scale robust design and optimization considering load uncertainties
- A survey of graph edit distance
- Computing sum of squares decompositions with rational coefficients
- Algorithm 950: Ncpol2sdpa -- sparse semidefinite programming relaxations for polynomial optimization problems of noncommuting variables
- Computing Gaussian \& exponential measures of semi-algebraic sets
- The \( \mathcal{N}=2 \) superconformal bootstrap
- Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
- On verified numerical computations in convex programming
- Kestrel: an interface from optimization modeling systems to the NEOS server
- Fastest mixing Markov chain on graphs with symmetries
- Robust synchronization analysis in nonlinear stochastic cellular networks with time-varying delays, intracellular perturbations and intercellular noise
- Polyhedral approximations of the semidefinite cone and their application
- NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials
- Computational enhancements in low-rank semidefinite programming
- Variational determination of the two-particle reduced density matrix within the doubly occupied configuration interaction space: exploiting translational and reflection invariance
- Numerical algebraic geometry and semidefinite programming
- Approximating optimization problems over convex functions
- 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
- Parameter identification in financial market models with a feasible point SQP algorithm
- Semidefinite programming for discrete optimization and matrix completion problems
- How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization
- A new approach for weighted constraint satisfaction
- Semi-definite programming for topology optimization of trusses under multiple eigenvalue constraints
- Constraints on 2d CFT partition functions
- New Turán densities for 3-graphs
- On the estimation of robustness and filtering ability of dynamic biochemical networks under process delays, internal parametric perturbations and external disturbances
- Solving nonconvex SDP problems of structural optimization with stability control
- Abstract interpretation meets convex optimization
- SOLVING LARGE SCALE OPTIMIZATION PROBLEMS VIA GRID AND CLUSTER COMPUTING(<Special Issue>Network Design, Control and Optimization)
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Certified roundoff error bounds using semidefinite programming
- On the relationship between convex bodies related to correlation experiments with dichotomic observables
- 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
- A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems
- Matrix-free convex optimization modeling
- Facial reduction algorithms for conic optimization problems
- High-Accuracy Semidefinite Programming Bounds for Kissing Numbers
- Applications of semidefinite programming
- Parallel implementation of successive convex relaxation methods for quadratic optimization problems
- scientific article; zbMATH DE number 5124934 (Why is no real title available?)
- On using quadratic interpolation of the determinant function to estimate the step-length in a predictor-corrector variant for semidefinite programming
- A constraint-reduced algorithm for semidefinite optimization problems with superlinear convergence
- Solving large-scale semidefinite programs in parallel
- Sums of squares, moment matrices and optimization over polynomials
- A Maximum Likelihood Approach to Density Estimation with Semidefinite Programming
- Application of facial reduction to \(H_\infty\) state feedback control problem
- Bounding the separable rank via polynomial optimization
- Confidence structural robust design and optimization under stiffness and load uncertainties
- Perturbation analysis of singular semidefinite programs and its applications to control problems
- On exact Reznick, Hilbert-Artin and Putinar's representations
- Group symmetry in interior-point methods for semidefinite program
- A conversion of an SDP having free variables into the standard form SDP
- Moment methods in energy minimization: new bounds for Riesz minimal energy problems
- On the implementation and usage of SDPT3 -- a Matlab software package for semidefinite-quadratic-linear programming, version 4.0
- A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming
- Implementation of interior point methods for mixed semidefinite and second order cone optimization problems
- Randomized heuristics for the Max-Cut problem
- SDPA PROJECT : SOLVING LARGE-SCALE SEMIDEFINITE PROGRAMS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
- Semidefinite programming based algorithms for the sparsest cut problem
- CSDP, A C library for semidefinite programming
- PENNON: A code for convex nonlinear and semidefinite programming
- Complexity of the primal–dual path-following algorithms for the weighted determinant maximization problems with linear matrix inequalities in the narrow neighbourhood
- Algorithmic Applications in Management
- Performance of convex underestimators in a branch-and-bound framework
- 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
- A non-linear arithmetic procedure for control-command software verification
- Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
- An independent benchmarking of SDP and SOCP solvers
This page was built for software: SDPA
