SDPA

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
• 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
• SEQUENTIAL SEMIDEFINITE PROGRAMMING FOR OPTIMIZATION OF FRAMED STRUCTURES UNDER MULTIMODAL BUCKLING CONSTRAINTS
• 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
• Semidefinite Programming Based Algorithms for the Sparsest Cut Problem
• A framework for solving mixed-integer semidefinite programs
• Moment methods in energy minimization: New bounds for Riesz minimal energy problems
• Application of facial reduction to H _∞ state feedback control problem
• Generalized self-concordant functions: a recipe for Newton-type methods
• On using Quadratic Interpolation of the Determinant Function to Estimate the Step-Length in a Predictor-Corrector Variant for Semidefinite Programming
• 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
• Computing Gaussian \& exponential measures of semi-algebraic sets
• Variational determination of the two-particle reduced density matrix within the doubly occupied configuration interaction space: exploiting translational and reflection invariance
• 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
• Bounding Extreme Events in Nonlinear Dynamics Using Convex Optimization
• Title not available (Why is that?)
• On the relationship between convex bodies related to correlation experiments with dichotomic observables
• A Single Entangled System Is an Unbounded Source of Nonlocal Correlations and of Certified Random Numbers
• Analysis of Linear Partial Differential Equations Using Convex Optimization
• Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization
• Bounding the separable rank via polynomial optimization
• Perturbation analysis of singular semidefinite programs and its applications to control problems
• On exact Reznick, Hilbert-Artin and Putinar's representations
• A conversion of an SDP having free variables into the standard form SDP
• Complexity of the primal–dual path-following algorithms for the weighted determinant maximization problems with linear matrix inequalities in the narrow neighbourhood
• Title not available (Why is that?)
• New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry
• Semidefinite Programming and Ramsey Numbers
• Title not available (Why is that?)
• Matrix-Free Convex Optimization Modeling
• MathOptInterface: A Data Structure for Mathematical Optimization Problems
• Title not available (Why is that?)
• Bounds on heat transport for convection driven by internal heating
• Solving polynomial least squares problems via semidefinite programming relaxations
• In SDP Relaxations, Inaccurate Solvers Do Robust Optimization
• Sparse noncommutative polynomial optimization
• Validating numerical semidefinite programming solvers for polynomial invariants
• Dimension reduction for semidefinite programs via Jordan algebras
• Exact Semidefinite Programming Bounds for Packing Problems
• Monotonicity of primal–dual interior-point algorithms for semidefinite programming problems
• A paradox in bosonic energy computations via semidefinite programming relaxations
• Title not available (Why is that?)
• The tracial moment problem and trace-optimization of polynomials
• Sums of squares in Macaulay2
• Title not available (Why is that?)
• Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools

This page was built for software: SDPA