Second-Order-Cone Constraints for Extended Trust-Region Subproblems
From MaRDI portal
Publication:5300533
DOI10.1137/110826862zbMath1298.90062OpenAlexW2100541427MaRDI QIDQ5300533
Kurt M. Anstreicher, Samuel Burer
Publication date: 27 June 2013
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/110826862
semidefinite programmingnonconvex quadratic programmingtrust-region subproblemsecond-order-cone programming
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Quadratic programming (90C20)
Related Items
An efficient algorithm for the extended trust-region subproblem with two linear constraints, Trust region subproblem with an additional linear inequality constraint, On the complexity of quadratic programming with two quadratic constraints, On box-constrained total least squares problem, On Convex Hulls of Epigraphs of QCQPs, On the tightness of SDP relaxations of QCQPs, A necessary and sufficient condition of convexity for SOC reformulation of trust-region subproblem with two intersecting cuts, Convex envelopes of separable functions over regions defined by separable functions of the same type, Finding Minimum Volume Circumscribing Ellipsoids Using Generalized Copositive Programming, Exactness conditions for an SDP relaxation of the extended trust region problem, A fast eigenvalue approach for solving the trust region subproblem with an additional linear inequality, On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations, Quadratic programs with hollows, Refined bounds on the convergence of block Lanczos method for extended trust-region subproblem, A computational study of global optimization solvers on two trust region subproblems, On globally solving the extended trust-region subproblems, Interplay of non-convex quadratically constrained problems with adjustable robust optimization, A survey of hidden convex optimization, Exact computable representation of some second-order cone constrained quadratic programming problems, A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints, On indefinite quadratic optimization over the intersection of balls and linear constraints, A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants, Exact two steps SOCP/SDP formulation for a modified conic trust region subproblem, Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs, Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods, A partial ellipsoidal approximation scheme for nonconvex homogeneous quadratic optimization with quadratic constraints, KKT-based primal-dual exactness conditions for the Shor relaxation, Optimization under uncertainty and risk: quadratic and copositive approaches, (Global) optimization: historical notes and recent developments, Finding second-order stationary points in constrained minimization: a feasible direction approach, Convex hull results on quadratic programs with non-intersecting constraints, Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization, Sharp and Fast Bounds for the Celis-Dennis-Tapia Problem, Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow, Closing the Gap between Necessary and Sufficient Conditions for Local Nonglobal Minimizer of Trust Region Subproblem, Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem, Kronecker Product Constraints with an Application to the Two-Trust-Region Subproblem, Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization, Representing quadratically constrained quadratic programs as generalized copositive programs, Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems, Quadratic optimization over one first-order cone, The generalized trust region subproblem, The Convex Hull of a Quadratic Constraint over a Polytope, Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization, A Block Lanczos Method for the Extended Trust-Region Subproblem, Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017, Globally solving extended trust region subproblems with two intersecting cuts, Quadratic optimization over a second-order cone with linear equality constraints, Coderivatives related to parametric extended trust region subproblem and their applications, Local nonglobal minima for solving large-scale extended trust-region subproblems, How to convexify the intersection of a second order cone and a nonconvex quadratic, New Results on Narrowing the Duality Gap of the Extended Celis--Dennis--Tapia Problem, Parametric approach for solving quadratic fractional optimization with a linear and a quadratic constraint, Conic approximation to nonconvex quadratic programming with convex quadratic constraints, Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming, A Note on Polynomial Solvability of the CDT Problem, Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations, Some results for quadratic problems with one or two quadratic constraints, An SOCP relaxation based branch-and-bound method for generalized trust-region subproblem, A Two-Variable Approach to the Two-Trust-Region Subproblem, An iterative algorithm for the conic trust region subproblem, The trust region subproblem with non-intersecting linear constraints, Exact dual bounds for some nonconvex minimax quadratic optimization problems, On Chebyshev Center of the Intersection of Two Ellipsoids, On Conic Relaxations of Generalization of the Extended Trust Region Subproblem, Solving Generalized CDT Problems via Two-Parameter Eigenvalues, A hybrid algorithm for the two-trust-region subproblem, Two-stage stochastic standard quadratic optimization, Quadratic optimization with two ball constraints, A Linear-Time Algorithm for Generalized Trust Region Subproblems, A gentle, geometric introduction to copositive optimization, Narrowing the difficulty gap for the Celis-Dennis-Tapia problem, A new SOCP relaxation of nonconvex quadratic programming problems with a few negative eigenvalues
