Handbook on semidefinite, conic and polynomial optimization
From MaRDI portal
Publication:636044
Applications of mathematical programming (90C90) Nonlinear programming (90C30) Semidefinite programming (90C22) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to operations research and mathematical programming (90-00)
Cited in
(only showing first 100 items - show all)- Euclidean distance bounds for linear matrix inequalities analytic centers using a novel bound on the Lambert function
- Computing Gaussian \& exponential measures of semi-algebraic sets
- A primal-dual regularized interior-point method for semidefinite programming
- Exact SDP relaxations of quadratically constrained quadratic programs with forest structures
- On equivalent representations and properties of faces of the cone of copositive matrices
- Exploiting term sparsity in noncommutative polynomial optimization
- Semidefinite Relaxations for Lebesgue and Gaussian Measures of Unions of Basic Semialgebraic Sets
- A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion
- Some experiences with solving semidefinite programming relaxations of binary quadratic optimization models in computational biology
- A guide to conic optimisation and its applications
- Scalable semidefinite programming
- The Variant of Primal Simplex-Type Method for Linear Second-Order Cone Programming
- Ordinal distance metric learning with MDS for image ranking
- Generalizations of doubly nonnegative cones and their comparison
- A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems
- Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space
- Accelerated proximal gradient method for bi-modulus static elasticity
- A variant of the affine-scaling method for a second-order cone program
- On Sum of Squares Representation of Convex Forms and Generalized Cauchy--Schwarz Inequalities
- On the weak second-order optimality condition for nonlinear semidefinite and second-order cone programming
- SDP-based branch-and-bound for non-convex quadratic integer optimization
- Intrinsic formulation and Lagrange duality for elastic cable networks with geometrical nonlinearity
- The theta number of simplicial complexes
- Validating numerical semidefinite programming solvers for polynomial invariants
- A primal-dual interior-point algorithm for symmetric cone convex quadratic programming based on the commutative class directions
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
- The moment-SOS hierarchy: applications and related topics
- Gaussian mixtures closest to a given measure via optimal transport
- Algebras, graphs and thetas
- Exploiting Lagrange duality for topology optimization with frictionless unilateral contact
- A preconditioned iterative interior point approach to the conic bundle subproblem
- \(LDL^T\) direction interior point method for semidefinite programming
- Weak notions of nondegeneracy in nonlinear semidefinite programming
- \texttt{EXPEDIS}: an exact penalty method over discrete sets
- Dimension-free entanglement detection in multipartite Werner states
- Convex Algebraic Geometry of Curvature Operators
- A Krylov subspace method for large-scale second-order cone linear complementarity problem
- Numerical simulation of base-isolated buildings in collisions with surrounding moat walls during earthquakes: a nonsmooth mechanics approach
- scientific article; zbMATH DE number 7626745 (Why is no real title available?)
- A Decomposition Augmented Lagrangian Method for Low-Rank Semidefinite Programming
- The constant trace property in noncommutative optimization
- An Ordinal Weighted EDM Model for Nonmetric Multidimensional Scaling
- Solving rank-constrained semidefinite programs in exact arithmetic
- Linear semidefinite programming problems: regularisation and strong dual formulations
- Improved semidefinite bounding procedure for solving max-cut problems to optimality
- Norm bounds and underestimators for unconstrained polynomial integer minimization
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
- scientific article; zbMATH DE number 7743708 (Why is no real title available?)
- Constrained trace-optimization of polynomials in freely noncommuting variables
- Optimization over trace polynomials
- A novel approach for solving semidefinite programs
- Global solution of non-convex quadratically constrained quadratic programs
- Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Alternative SDP and SOCP approximations for polynomial optimization
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
- Perturbation analysis of singular semidefinite programs and its applications to control problems
- BiqBin: moving boundaries for NP-hard problems by HPC
- Lower bounds for cubic optimization over the sphere
- On optimality conditions for nonlinear conic programming
- Improved exact approaches for row layout problems with departments of equal length
- Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems
- Lifting and separation procedures for the cut polytope
- Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach
- Construction of a class of sharp Löwner majorants for a set of symmetric matrices
- Semidefinite resolution and exactness of semidefinite relaxations for satisfiability
- Sparse noncommutative polynomial optimization
- Gaddum's test for symmetric cones
- Optimality properties of Galerkin and Petrov-Galerkin methods for linear matrix equations
- Approximation algorithms for optimization of real-valued general conjugate complex forms
- Borel measures with a density on a compact semi-algebraic set
- A fresh variational-analysis look at the positive semidefinite matrices world
- Moment approximations for set-semidefinite polynomials
- Three-monotone interpolation
- Primal-dual interior-point algorithms for convex quadratic circular cone optimization
- Global optimization of trusses with constraints on number of different cross-sections: a mixed-integer second-order cone programming approach
- Structural reliability under uncertainty in moments: distributionally-robust reliability-based design optimization
- A primal-dual interior point trust-region method for nonlinear semidefinite programming
- Exact algorithms for linear matrix inequalities
- Mathematical programming models and exact algorithms
- Optimal size of linear matrix inequalities in semidefinite approaches to polynomial optimization
- Sufficient optimality conditions hold for almost all nonlinear semidefinite programs
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization
- New semidefinite programming relaxations for the linear ordering and the traveling salesman problem
- Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools
- Spectrahedral shadows
- Ellipsoidal load-domain shakedown analysis with von Mises yield criterion: A robust optimization approach
- Accelerated proximal gradient method for elastoplastic analysis with von Mises yield criterion
- Second-Order Cone Representation for Convex Sets in the Plane
- Single row layout models
- On semidefinite least squares and minimal unsatisfiability
- Book review of: J.-B. Lasserre, An introduction to polynomial and semi-algebraic optimization
- Book review of: J. B. Lasserre, An introduction to polynomial and semi-algebraic optimization
- A fast first-order optimization approach to elastoplastic analysis of skeletal structures
- Continuous multifacility ordered median location problems
- A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
- A computational study for bilevel quadratic programs using semidefinite relaxations
- Completely positive reformulations for polynomial optimization
- Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization
This page was built for publication: Handbook on semidefinite, conic and polynomial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q636044)
