Pages that link to "Item:Q463723"
From MaRDI portal
The following pages link to Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization (Q463723):
Displaying 50 items.
- S-lemma with equality and its applications (Q263215) (← links)
- 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)
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints (Q513160) (← 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)
- 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 branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints (Q1679484) (← links)
- Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap (Q1685581) (← links)
- On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint (Q1749450) (← links)
- Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers (Q1756794) (← links)
- Centered solutions for uncertain linear equations (Q1789636) (← links)
- Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma (Q1987329) (← 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)
- 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)
- An active-set algorithm for norm constrained quadratic problems (Q2133422) (← links)
- Refined bounds on the convergence of block Lanczos method for extended trust-region subproblem (Q2165873) (← 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)
- A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs (Q2244199) (← links)
- Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality (Q2273897) (← links)
- A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints (Q2294373) (← links)
- Strong duality in minimizing a quadratic form subject to two homogeneous quadratic inequalities over the unit sphere (Q2301183) (← links)
- A gentle, geometric introduction to copositive optimization (Q2349118) (← links)
- Narrowing the difficulty gap for the Celis-Dennis-Tapia problem (Q2349132) (← 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)
- The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables (Q2670502) (← links)
- On indefinite quadratic optimization over the intersection of balls and linear constraints (Q2671444) (← links)
- A Note on Polynomial Solvability of the CDT Problem (Q2789609) (← links)
- A Two-Variable Approach to the Two-Trust-Region Subproblem (Q2796795) (← links)
- Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems (Q4609471) (← links)
- A Block Lanczos Method for the Extended Trust-Region Subproblem (Q4629333) (← links)
- Characterizing Convexity of Images for Quadratic-Linear Mappings with Applications in Nonconvex Quadratic Optimization (Q5003213) (← links)
- On Convex Hulls of Epigraphs of QCQPs (Q5041762) (← links)
- On Local Non-Global Minimizers of Quadratic Optimization Problem with a Single Quadratic Constraint (Q5107288) (← links)
- A Trust Region Method for Finding Second-Order Stationarity in Linearly Constrained Nonconvex Optimization (Q5124006) (← links)
- Online First-Order Framework for Robust Convex Optimization (Q5131545) (← links)
- (Q5208226) (← links)
- On Conic Relaxations of Generalization of the Extended Trust Region Subproblem (Q5214417) (← links)
- Novel Reformulations and Efficient Algorithms for the Generalized Trust Region Subproblem (Q5231678) (← links)
- A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants (Q5348458) (← links)
- Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems (Q5501200) (← links)
