Pages that link to "Item:Q636044"

The following pages link to Handbook on semidefinite, conic and polynomial optimization (Q636044):

Displaying 50 items.

• Sufficient optimality conditions hold for almost all nonlinear semidefinite programs (Q304224) (← links)
• Single row layout models (Q319651) (← links)
• Continuous multifacility ordered median location problems (Q322399) (← links)
• A computational study for bilevel quadratic programs using semidefinite relaxations (Q323274) (← links)
• Generating cutting planes for the semidefinite relaxation of quadratic programs (Q337405) (← links)
• On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods (Q359624) (← links)
• Borel measures with a density on a compact semi-algebraic set (Q382256) (← links)
• Moment approximations for set-semidefinite polynomials (Q382904) (← links)
• Lifting and separation procedures for the cut polytope (Q403653) (← links)
• A fresh variational-analysis look at the positive semidefinite matrices world (Q438781) (← links)
• Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization (Q493059) (← links)
• On semidefinite least squares and minimal unsatisfiability (Q516798) (← links)
• Approximation algorithms for optimization of real-valued general conjugate complex forms (Q683722) (← links)
• Norm bounds and underestimators for unconstrained polynomial integer minimization (Q684153) (← links)
• Sums of squares of polynomials with rational coefficients (Q726755) (← links)
• New semidefinite programming relaxations for the linear ordering and the traveling salesman problem (Q729796) (← links)
• Approximation methods for complex polynomial optimization (Q742305) (← links)
• Construction of a class of sharp Löwner majorants for a set of symmetric matrices (Q778636) (← links)
• A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization (Q905304) (← links)
• Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach (Q1616936) (← links)
• Improved exact approaches for row layout problems with departments of equal length (Q1651703) (← links)
• Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization (Q1704915) (← links)
• Accelerated proximal gradient method for elastoplastic analysis with von Mises yield criterion (Q1742869) (← links)
• Real zero polynomials and A. Horn's problem (Q1754431) (← links)
• Alternating direction method of multipliers for truss topology optimization with limited number of nodes: a cardinality-constrained second-order cone programming approach (Q1787322) (← links)
• Gaddum's test for symmetric cones (Q2022297) (← links)
• Optimality properties of Galerkin and Petrov-Galerkin methods for linear matrix equations (Q2022383) (← links)
• Perturbation analysis of singular semidefinite programs and its applications to control problems (Q2026715) (← links)
• Lower bounds for cubic optimization over the sphere (Q2031942) (← links)
• Optimization over trace polynomials (Q2068367) (← links)
• Structural reliability under uncertainty in moments: distributionally-robust reliability-based design optimization (Q2070152) (← links)
• Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space (Q2079694) (← links)
• Dimension-free entanglement detection in multipartite Werner states (Q2099794) (← links)
• Exact SDP relaxations of quadratically constrained quadratic programs with forest structures (Q2114577) (← links)
• Algebras, graphs and thetas (Q2132354) (← links)
• Accelerated proximal gradient method for bi-modulus static elasticity (Q2138312) (← links)
• Sparse noncommutative polynomial optimization (Q2144551) (← links)
• An exact completely positive programming formulation for the discrete ordered median problem: an extended version (Q2176282) (← links)
• Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs (Q2188238) (← links)
• Numerical simulation of base-isolated buildings in collisions with surrounding moat walls during earthquakes: a nonsmooth mechanics approach (Q2218900) (← links)
• Exploiting term sparsity in noncommutative polynomial optimization (Q2231045) (← links)
• A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion (Q2236545) (← links)
• Robust SOS-convex polynomial optimization problems: exact SDP relaxations (Q2257075) (← links)
• Alternative SDP and SOCP approximations for polynomial optimization (Q2287850) (← links)
• Exploiting Lagrange duality for topology optimization with frictionless unilateral contact (Q2300950) (← links)
• A primal-dual interior-point algorithm for symmetric cone convex quadratic programming based on the commutative class directions (Q2316302) (← links)
• The theta number of simplicial complexes (Q2317686) (← links)
• Lower bounds on matrix factorization ranks via noncommutative polynomial optimization (Q2329041) (← links)
• A novel approach for solving semidefinite programs (Q2336591) (← links)
• Completely positive reformulations for polynomial optimization (Q2349130) (← links)