Handbook on semidefinite, conic and polynomial optimization
From MaRDI portal
(Redirected from 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)- A fresh variational-analysis look at the positive semidefinite matrices world
- Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space
- SDP-based branch-and-bound for non-convex quadratic integer optimization
- The constant trace property in noncommutative optimization
- Linear semidefinite programming problems: regularisation and strong dual formulations
- Borel measures with a density on a compact semi-algebraic set
- Moment approximations for set-semidefinite polynomials
- On semidefinite least squares and minimal unsatisfiability
- A variant of the affine-scaling method for a second-order cone program
- Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems
- Three-monotone interpolation
- A primal-dual interior-point algorithm for symmetric cone convex quadratic programming based on the commutative class directions
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
- A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems
- Spectrahedral shadows
- A novel approach for solving semidefinite programs
- Global optimization of trusses with constraints on number of different cross-sections: a mixed-integer second-order cone programming approach
- A preconditioned iterative interior point approach to the conic bundle subproblem
- Weak notions of nondegeneracy in nonlinear semidefinite programming
- Sums of squares of polynomials with rational coefficients
- Dimension-free entanglement detection in multipartite Werner states
- BiqBin: moving boundaries for NP-hard problems by HPC
- Lifting and separation procedures for the cut polytope
- Approximation algorithms for optimization of real-valued general conjugate complex forms
- Approximation methods for complex polynomial optimization
- Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools
- Numerical simulation of base-isolated buildings in collisions with surrounding moat walls during earthquakes: a nonsmooth mechanics approach
- Some experiences with solving semidefinite programming relaxations of binary quadratic optimization models in computational biology
- An Ordinal Weighted EDM Model for Nonmetric Multidimensional Scaling
- Mathematical programming models and exact algorithms
- Improved semidefinite bounding procedure for solving max-cut problems to optimality
- 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
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Computing Gaussian \& exponential measures of semi-algebraic sets
- Exact SDP relaxations of quadratically constrained quadratic programs with forest structures
- Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization
- A Krylov subspace method for large-scale second-order cone linear complementarity problem
- 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
- Accelerated proximal gradient method for elastoplastic analysis with von Mises yield criterion
- Solving rank-constrained semidefinite programs in exact arithmetic
- On the weak second-order optimality condition for nonlinear semidefinite and second-order cone programming
- A guide to conic optimisation and its applications
- On Sum of Squares Representation of Convex Forms and Generalized Cauchy--Schwarz Inequalities
- Robust SOS-convex polynomial optimization problems: exact SDP relaxations
- Algebras, graphs and thetas
- Real zero polynomials and A. Horn's problem
- Optimality conditions in semidefinite programming
- Optimization over trace polynomials
- Alternative SDP and SOCP approximations for polynomial optimization
- Constrained trace-optimization of polynomials in freely noncommuting variables
- Accelerated proximal gradient method for bi-modulus static elasticity
- Gaddum's test for symmetric cones
- Optimality properties of Galerkin and Petrov-Galerkin methods for linear matrix equations
- The moment-SOS hierarchy: applications and related topics
- A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
- Intrinsic formulation and Lagrange duality for elastic cable networks with geometrical nonlinearity
- Sufficient optimality conditions hold for almost all nonlinear semidefinite programs
- Optimal size of linear matrix inequalities in semidefinite approaches to polynomial optimization
- New semidefinite programming relaxations for the linear ordering and the traveling salesman problem
- Semidefinite resolution and exactness of semidefinite relaxations for satisfiability
- 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
- On optimality conditions for nonlinear conic programming
- Perturbation analysis of singular semidefinite programs and its applications to control problems
- Lower bounds for cubic optimization over the sphere
- Global solution of non-convex quadratically constrained quadratic programs
- Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations
- Single row layout models
- The theta number of simplicial complexes
- Generalizations of doubly nonnegative cones and their comparison
- Improved exact approaches for row layout problems with departments of equal length
- 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
- Ellipsoidal load-domain shakedown analysis with von Mises yield criterion: A robust optimization approach
- An exact completely positive programming formulation for the discrete ordered median problem: an extended version
- Convex Algebraic Geometry of Curvature Operators
- Primal-dual interior-point algorithms for convex quadratic circular cone optimization
- \(LDL^T\) direction interior point method for semidefinite programming
- Convergence to a second-order critical point by a primal-dual interior point trust-region method for nonlinear semidefinite programming
- Algorithm 996
- Generating cutting planes for the semidefinite relaxation of quadratic programs
- Alternating direction method of multipliers for truss topology optimization with limited number of nodes: a cardinality-constrained second-order cone programming approach
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization
- Book review of: J. B. Lasserre, An introduction to polynomial and semi-algebraic optimization
- 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
- Gaussian mixtures closest to a given measure via optimal transport
- A Decomposition Augmented Lagrangian Method for Low-Rank Semidefinite Programming
- Completely positive reformulations for polynomial optimization
- \texttt{EXPEDIS}: an exact penalty method over discrete sets
- The Variant of Primal Simplex-Type Method for Linear Second-Order Cone Programming
- A primal-dual interior point trust-region method for nonlinear semidefinite programming
- Euclidean distance bounds for linear matrix inequalities analytic centers using a novel bound on the Lambert function
- 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
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)
