Pages that link to "Item:Q5300533"

The following pages link to Second-Order-Cone Constraints for Extended Trust-Region Subproblems (Q5300533):

Displaying 50 items.

• Trust region subproblem with an additional linear inequality constraint (Q276335) (← links)
• Exactness conditions for an SDP relaxation of the extended trust region problem (Q315474) (← links)
• Exact computable representation of some second-order cone constrained quadratic programming problems (Q384217) (← links)
• Representing quadratically constrained quadratic programs as generalized copositive programs (Q439919) (← links)
• The generalized trust region subproblem (Q457202) (← links)
• Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization (Q463723) (← links)
• Quadratic optimization over a second-order cone with linear equality constraints (Q489094) (← links)
• Local nonglobal minima for solving large-scale extended trust-region subproblems (Q513712) (← links)
• How to convexify the intersection of a second order cone and a nonconvex quadratic (Q517311) (← links)
• Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations (Q721169) (← links)
• Quadratic optimization with two ball constraints (Q779620) (← links)
• On box-constrained total least squares problem (Q827567) (← links)
• Convergence to a second-order point of a trust-region algorithm with a nonmonotonic penalty parameter for constrained optimization (Q1359463) (← links)
• Convex envelopes of separable functions over regions defined by separable functions of the same type (Q1634777) (← links)
• A fast eigenvalue approach for solving the trust region subproblem with an additional linear inequality (Q1655381) (← links)
• Quadratic programs with hollows (Q1659682) (← links)
• A computational study of global optimization solvers on two trust region subproblems (Q1668805) (← links)
• A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints (Q1679484) (← links)
• Exact two steps SOCP/SDP formulation for a modified conic trust region subproblem (Q1686558) (← links)
• Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization (Q1704915) (← links)
• Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 (Q1731962) (← links)
• Some results for quadratic problems with one or two quadratic constraints (Q1785624) (← links)
• An iterative algorithm for the conic trust region subproblem (Q1791853) (← links)
• Coderivatives related to parametric extended trust region subproblem and their applications (Q1990393) (← links)
• Parametric approach for solving quadratic fractional optimization with a linear and a quadratic constraint (Q2013617) (← links)
• Conic approximation to nonconvex quadratic programming with convex quadratic constraints (Q2018510) (← links)
• An SOCP relaxation based branch-and-bound method for generalized trust-region subproblem (Q2031320) (← links)
• Exact dual bounds for some nonconvex minimax quadratic optimization problems (Q2043977) (← links)
• Two-stage stochastic standard quadratic optimization (Q2077956) (← links)
• A new SOCP relaxation of nonconvex quadratic programming problems with a few negative eigenvalues (Q2112679) (← links)
• An efficient algorithm for the extended trust-region subproblem with two linear constraints (Q2119320) (← links)
• On the tightness of SDP relaxations of QCQPs (Q2133408) (← links)
• Refined bounds on the convergence of block Lanczos method for extended trust-region subproblem (Q2165873) (← links)
• A survey of hidden convex optimization (Q2176821) (← links)
• Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs (Q2188238) (← links)
• Finding second-order stationary points in constrained minimization: a feasible direction approach (Q2194125) (← links)
• Globally solving extended trust region subproblems with two intersecting cuts (Q2228371) (← links)
• Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming (Q2274889) (← links)
• A hybrid algorithm for the two-trust-region subproblem (Q2322760) (← links)
• A gentle, geometric introduction to copositive optimization (Q2349118) (← links)
• Narrowing the difficulty gap for the Celis-Dennis-Tapia problem (Q2349132) (← links)
• On the complexity of quadratic programming with two quadratic constraints (Q2364486) (← links)
• Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization (Q2425177) (← links)
• Quadratic optimization over one first-order cone (Q2438413) (← links)
• The trust region subproblem with non-intersecting linear constraints (Q2515041) (← links)
• A necessary and sufficient condition of convexity for SOC reformulation of trust-region subproblem with two intersecting cuts (Q2628919) (← links)
• On globally solving the extended trust-region subproblems (Q2661497) (← links)
• Interplay of non-convex quadratically constrained problems with adjustable robust optimization (Q2661757) (← links)
• On indefinite quadratic optimization over the intersection of balls and linear constraints (Q2671444) (← links)
• Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow (Q2689820) (← links)