Handbook on semidefinite, conic and polynomial optimization
From MaRDI portal
Publication:636044
DOI10.1007/978-1-4614-0769-0zbMATH Open1235.90002OpenAlexW91728630MaRDI QIDQ636044FDOQ636044
Authors:
Publication date: 25 August 2011
Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-0769-0
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)
- A novel approach for solving semidefinite programs
- Sums of squares of polynomials with rational coefficients
- Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization
- Lifting and separation procedures for the cut polytope
- Approximation algorithms for optimization of real-valued general conjugate complex forms
- Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools
- Approximation methods for complex polynomial optimization
- On Optimality Conditions for Nonlinear Conic Programming
- Improved semidefinite bounding procedure for solving max-cut problems to optimality
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach
- Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization
- Accelerated proximal gradient method for elastoplastic analysis with von Mises yield criterion
- Robust SOS-convex polynomial optimization problems: exact SDP relaxations
- Real zero polynomials and A. Horn's problem
- Constrained trace-optimization of polynomials in freely noncommuting variables
- Optimization over trace polynomials
- Alternative SDP and SOCP approximations for polynomial optimization
- Gaddum's test for symmetric cones
- Optimality properties of Galerkin and Petrov-Galerkin methods for linear matrix equations
- A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
- Semidefinite resolution and exactness of semidefinite relaxations for satisfiability
- Sufficient optimality conditions hold for almost all nonlinear semidefinite programs
- New semidefinite programming relaxations for the linear ordering and the traveling salesman problem
- A fast first-order optimization approach to elastoplastic analysis of skeletal structures
- Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
- Global solution of non-convex quadratically constrained quadratic programs
- Perturbation analysis of singular semidefinite programs and its applications to control problems
- Lower bounds for cubic optimization over the sphere
- Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations
- Single row layout models
- Improved exact approaches for row layout problems with departments of equal length
- Ellipsoidal load-domain shakedown analysis with von Mises yield criterion: A robust optimization approach
- Book review of: J.-B. Lasserre, An introduction to polynomial and semi-algebraic optimization
- Continuous multifacility ordered median location problems
- A computational study for bilevel quadratic programs using semidefinite relaxations
- An exact completely positive programming formulation for the discrete ordered median problem: an extended version
- Spectrahedral Shadows
- Primal-dual interior-point algorithms for convex quadratic circular cone optimization
- Convergence to a second-order critical point by a primal-dual interior point trust-region method for nonlinear semidefinite programming
- Optimality Conditions in Semidefinite Programming
- Algorithm 996
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
- Alternating direction method of multipliers for truss topology optimization with limited number of nodes: a cardinality-constrained second-order cone programming approach
- Generating cutting planes for the semidefinite relaxation of quadratic programs
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization
- Book review of: J. B. Lasserre, An introduction to polynomial and semi-algebraic optimization
- BiqBin: Moving Boundaries for NP-hard Problems by HPC
- Structural reliability under uncertainty in moments: distributionally-robust reliability-based design 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
- Completely positive reformulations for polynomial optimization
- Mathematical Programming Models and Exact Algorithms
- A primal-dual interior point trust-region method for nonlinear semidefinite programming
- Exact algorithms for linear matrix inequalities
- Second-Order Cone Representation for Convex Sets in the Plane
- A Newton-bracketing method for a simple conic optimization problem
- Sparse noncommutative polynomial optimization
- Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone
- Title not available (Why is that?)
- Construction of a class of sharp Löwner majorants for a set of symmetric matrices
- Norm bounds and underestimators for unconstrained polynomial integer minimization
- A fresh variational-analysis look at the positive semidefinite matrices world
- Borel measures with a density on a compact semi-algebraic set
- Moment approximations for set-semidefinite polynomials
- Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems
- On semidefinite least squares and minimal unsatisfiability
- Three-monotone interpolation
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
- Global optimization of trusses with constraints on number of different cross-sections: a mixed-integer second-order cone programming approach
- Dimension-free entanglement detection in multipartite Werner states
- Numerical simulation of base-isolated buildings in collisions with surrounding moat walls during earthquakes: a nonsmooth mechanics approach
- An Ordinal Weighted EDM Model for Nonmetric Multidimensional Scaling
- $LDL^T$ Direction Interior Point Method for Semidefinite Programming
- On equivalent representations and properties of faces of the cone of copositive matrices
- Computing Gaussian \& exponential measures of semi-algebraic sets
- Exact SDP relaxations of quadratically constrained quadratic programs with forest structures
- Semidefinite Relaxations for Lebesgue and Gaussian Measures of Unions of Basic Semialgebraic Sets
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
- On the weak second-order optimality condition for nonlinear semidefinite and second-order cone programming
- Solving rank-constrained semidefinite programs in exact arithmetic
- A guide to conic optimisation and its applications
- On Sum of Squares Representation of Convex Forms and Generalized Cauchy--Schwarz Inequalities
- Algebras, graphs and thetas
- Euclidean Distance Bounds for Linear Matrix Inequalities Analytic Centers Using a Novel Bound on the Lambert Function
- Ordinal Distance Metric Learning with MDS for Image Ranking
- The moment-SOS hierarchy: applications and related topics
- Accelerated proximal gradient method for bi-modulus static elasticity
- SOME EXPERIENCES WITH SOLVING SEMIDEFINITE PROGRAMMING RELAXATIONS OF BINARY QUADRATIC OPTIMIZATION MODELS IN COMPUTATIONAL BIOLOGY
- Intrinsic formulation and Lagrange duality for elastic cable networks with geometrical nonlinearity
- Scalable Semidefinite Programming
- A primal–dual regularized interior-point method for semidefinite programming
- Generalizations of doubly nonnegative cones and their comparison
- The theta number of simplicial complexes
- Convex Algebraic Geometry of Curvature Operators
- Gaussian mixtures closest to a given measure via optimal transport
- A Decomposition Augmented Lagrangian Method for Low-Rank Semidefinite Programming
- \texttt{EXPEDIS}: an exact penalty method over discrete sets
- The Variant of Primal Simplex-Type Method for Linear Second-Order Cone Programming
- Title not available (Why is that?)
- Validating numerical semidefinite programming solvers for polynomial invariants
Uses Software
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)
