Handbook on semidefinite, conic and polynomial optimization
From MaRDI portal
Publication:636044
DOI10.1007/978-1-4614-0769-0zbMath1235.90002OpenAlexW91728630MaRDI QIDQ636044
No author found.
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
Semidefinite programming (90C22) Applications of mathematical programming (90C90) Nonlinear programming (90C30) 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)
Related Items (only showing first 100 items - show all)
Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems ⋮ Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems ⋮ A Decomposition Augmented Lagrangian Method for Low-Rank Semidefinite Programming ⋮ Weak notions of nondegeneracy in nonlinear semidefinite programming ⋮ A preconditioned iterative interior point approach to the conic bundle subproblem ⋮ A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems ⋮ A fast first-order optimization approach to elastoplastic analysis of skeletal structures ⋮ Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach ⋮ On equivalent representations and properties of faces of the cone of copositive matrices ⋮ Algebras, graphs and thetas ⋮ Mathematical Programming Models and Exact Algorithms ⋮ Accelerated proximal gradient method for bi-modulus static elasticity ⋮ Sufficient optimality conditions hold for almost all nonlinear semidefinite programs ⋮ Intrinsic formulation and Lagrange duality for elastic cable networks with geometrical nonlinearity ⋮ Sparse noncommutative polynomial optimization ⋮ Convergence to a second-order critical point by a primal-dual interior point trust-region method for nonlinear semidefinite programming ⋮ Single row layout models ⋮ Continuous multifacility ordered median location problems ⋮ A computational study for bilevel quadratic programs using semidefinite relaxations ⋮ Euclidean Distance Bounds for Linear Matrix Inequalities Analytic Centers Using a Novel Bound on the Lambert Function ⋮ Generating cutting planes for the semidefinite relaxation of quadratic programs ⋮ Improved exact approaches for row layout problems with departments of equal length ⋮ Computing Gaussian \& exponential measures of semi-algebraic sets ⋮ On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods ⋮ SOME EXPERIENCES WITH SOLVING SEMIDEFINITE PROGRAMMING RELAXATIONS OF BINARY QUADRATIC OPTIMIZATION MODELS IN COMPUTATIONAL BIOLOGY ⋮ Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone ⋮ An exact completely positive programming formulation for the discrete ordered median problem: an extended version ⋮ Solving rank-constrained semidefinite programs in exact arithmetic ⋮ Borel measures with a density on a compact semi-algebraic set ⋮ Moment approximations for set-semidefinite polynomials ⋮ An Ordinal Weighted EDM Model for Nonmetric Multidimensional Scaling ⋮ \texttt{EXPEDIS}: an exact penalty method over discrete sets ⋮ SDP-based branch-and-bound for non-convex quadratic integer optimization ⋮ Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools ⋮ Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs ⋮ Ellipsoidal load-domain shakedown analysis with von Mises yield criterion: A robust optimization approach ⋮ Lifting and separation procedures for the cut polytope ⋮ On the weak second-order optimality condition for nonlinear semidefinite and second-order cone programming ⋮ Semidefinite Relaxations for Lebesgue and Gaussian Measures of Unions of Basic Semialgebraic Sets ⋮ A variant of the affine-scaling method for a second-order cone program ⋮ Spectrahedral Shadows ⋮ A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization ⋮ Ordinal Distance Metric Learning with MDS for Image Ranking ⋮ BiqBin: Moving Boundaries for NP-hard Problems by HPC ⋮ Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization ⋮ A fresh variational-analysis look at the positive semidefinite matrices world ⋮ Improved semidefinite bounding procedure for solving max-cut problems to optimality ⋮ $LDL^T$ Direction Interior Point Method for Semidefinite Programming ⋮ Unnamed Item ⋮ Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations ⋮ Semidefinite resolution and exactness of semidefinite relaxations for satisfiability ⋮ Numerical simulation of base-isolated buildings in collisions with surrounding moat walls during earthquakes: a nonsmooth mechanics approach ⋮ On Sum of Squares Representation of Convex Forms and Generalized Cauchy--Schwarz Inequalities ⋮ A guide to conic optimisation and its applications ⋮ Exploiting term sparsity in noncommutative polynomial optimization ⋮ Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization ⋮ A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion ⋮ Accelerated proximal gradient method for elastoplastic analysis with von Mises yield criterion ⋮ Unnamed Item ⋮ Global solution of non-convex quadratically constrained quadratic programs ⋮ Approximation algorithms for optimization of real-valued general conjugate complex forms ⋮ On semidefinite least squares and minimal unsatisfiability ⋮ Norm bounds and underestimators for unconstrained polynomial integer minimization ⋮ Real zero polynomials and A. Horn's problem ⋮ Robust SOS-convex polynomial optimization problems: exact SDP relaxations ⋮ Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization ⋮ Gaddum's test for symmetric cones ⋮ Optimality properties of Galerkin and Petrov-Galerkin methods for linear matrix equations ⋮ Validating numerical semidefinite programming solvers for polynomial invariants ⋮ Perturbation analysis of singular semidefinite programs and its applications to control problems ⋮ Alternating direction method of multipliers for truss topology optimization with limited number of nodes: a cardinality-constrained second-order cone programming approach ⋮ Sums of squares of polynomials with rational coefficients ⋮ Lower bounds for cubic optimization over the sphere ⋮ New semidefinite programming relaxations for the linear ordering and the traveling salesman problem ⋮ Intersection cuts for nonlinear integer programming: convexification techniques for structured sets ⋮ Global optimization of trusses with constraints on number of different cross-sections: a mixed-integer second-order cone programming approach ⋮ Alternative SDP and SOCP approximations for polynomial optimization ⋮ Constrained trace-optimization of polynomials in freely noncommuting variables ⋮ Algorithm 996 ⋮ Semidefinite relaxations for partitioning, assignment and ordering problems ⋮ Approximation methods for complex polynomial optimization ⋮ Exploiting Lagrange duality for topology optimization with frictionless unilateral contact ⋮ Optimization over trace polynomials ⋮ A primal-dual interior-point algorithm for symmetric cone convex quadratic programming based on the commutative class directions ⋮ Structural reliability under uncertainty in moments: distributionally-robust reliability-based design optimization ⋮ The theta number of simplicial complexes ⋮ Exact Algorithms for Linear Matrix Inequalities ⋮ Convex Algebraic Geometry of Curvature Operators ⋮ Construction of a class of sharp Löwner majorants for a set of symmetric matrices ⋮ Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space ⋮ Lower bounds on matrix factorization ranks via noncommutative polynomial optimization ⋮ A Newton-bracketing method for a simple conic optimization problem ⋮ A primal-dual interior point trust-region method for nonlinear semidefinite programming ⋮ Scalable Semidefinite Programming ⋮ A Krylov Subspace Method for Large-Scale Second-Order Cone Linear Complementarity Problem ⋮ A novel approach for solving semidefinite programs ⋮ Second-Order Cone Representation for Convex Sets in the Plane ⋮ Dimension-free entanglement detection in multipartite Werner states ⋮ Completely positive reformulations for polynomial optimization ⋮ On Optimality Conditions for Nonlinear Conic Programming
Uses Software
This page was built for publication: Handbook on semidefinite, conic and polynomial optimization
