Pages that link to "Item:Q2436648"
From MaRDI portal
The following pages link to Hidden conic quadratic representation of some nonconvex quadratic optimization problems (Q2436648):
Displayed 47 items.
- S-lemma with equality and its applications (Q263215) (← links)
- Exactness conditions for an SDP relaxation of the extended trust region problem (Q315474) (← links)
- Robust fractional programming (Q493047) (← links)
- Convex envelopes of separable functions over regions defined by separable functions of the same type (Q1634777) (← links)
- SOCP reformulation for the generalized trust region subproblem via a canonical form of two symmetric matrices (Q1646573) (← links)
- A survey of adjustable robust optimization (Q1740490) (← links)
- Some results for quadratic problems with one or two quadratic constraints (Q1785624) (← links)
- Efficient local search procedures for quadratic fractional programming problems (Q1986108) (← links)
- Exact conic programming reformulations of two-stage adjustable robust linear programs with new quadratic decision rules (Q1996732) (← links)
- Maximizing perturbation radii for robust convex quadratically constrained quadratic programs (Q2030501) (← links)
- An SOCP relaxation based branch-and-bound method for generalized trust-region subproblem (Q2031320) (← links)
- An efficient PGM-based algorithm with backtracking strategy for solving quadratic optimization problems with spherical constraint (Q2104089) (← links)
- A new SOCP relaxation of nonconvex quadratic programming problems with a few negative eigenvalues (Q2112679) (← links)
- The generalized trust region subproblem: solution complexity and convex hull results (Q2118085) (← links)
- On the tightness of SDP relaxations of QCQPs (Q2133408) (← links)
- First- and second-order optimality conditions for quadratically constrained quadratic programming problems (Q2139247) (← links)
- A survey of hidden convex optimization (Q2176821) (← links)
- A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs (Q2244199) (← links)
- Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming (Q2274889) (← links)
- A conjugate gradient-based algorithm for large-scale quadratic programming problem with one quadratic constraint (Q2322558) (← links)
- A simultaneous diagonalization based SOCP relaxation for convex quadratic programs with linear complementarity constraints (Q2329678) (← links)
- On the complexity of quadratic programming with two quadratic constraints (Q2364486) (← links)
- A simultaneous diagonalization based SOCP relaxation for portfolio optimization with an orthogonality constraint (Q2701425) (← links)
- Simultaneous Diagonalization of Matrices and Its Applications in Quadratically Constrained Quadratic Programming (Q2817836) (← links)
- Fast computation of a rational point of a variety over a finite field (Q3420246) (← links)
- Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems (Q4609471) (← links)
- Minimizing an indefinite quadratic function subject to a single indefinite quadratic constraint (Q4639117) (← links)
- A simultaneous diagonalization-based quadratic convex reformulation for nonconvex quadratically constrained quadratic program (Q5038154) (← links)
- On Convex Hulls of Epigraphs of QCQPs (Q5041762) (← links)
- An Algorithm for Maximizing a Convex Function Based on Its Minimum (Q5060795) (← links)
- An Approximation Scheme for Distributionally Robust PDE-Constrained Optimization (Q5081087) (← links)
- On Local Non-Global Minimizers of Quadratic Optimization Problem with a Single Quadratic Constraint (Q5107288) (← 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)
- Connectivity of Quadratic Hypersurfaces and Its Applications in Optimization, Part I: General Theory (Q5254997) (← links)
- A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants (Q5348458) (← links)
- A Linear-Time Algorithm for Generalized Trust Region Subproblems (Q5853724) (← links)
- A survey of nonlinear robust optimization (Q5882395) (← links)
- Positive semidefinite interval of matrix pencil and its applications to the generalized trust region subproblems (Q6087885) (← links)
- KKT-based primal-dual exactness conditions for the Shor relaxation (Q6104908) (← links)
- Implicit Regularity and Linear Convergence Rates for the Generalized Trust-Region Subproblem (Q6114784) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)
- A new technique to derive tight convex underestimators (sometimes envelopes) (Q6155069) (← links)
- Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints (Q6166654) (← links)
- Quadratically adjustable robust linear optimization with inexact data via generalized S-lemma: exact second-order cone program reformulations (Q6169993) (← links)
- Effective algorithms for optimal portfolio deleveraging problem with cross impact (Q6178391) (← links)
- Projectively and Weakly Simultaneously Diagonalizable Matrices and their Applications (Q6180358) (← links)