Pages that link to "Item:Q1278289"
From MaRDI portal
The following pages link to Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid (Q1278289):
Displaying 20 items.
- The generalized trust region subproblem (Q457202) (← links)
- Strong duality for generalized trust region subproblem: S-lemma with interval bounds (Q497446) (← links)
- Kalman-Popov-Yakubovich Lemma and the \(S\)-procedure: a historical essay (Q885768) (← links)
- Difference of convex functions optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres (Q1362986) (← links)
- Potential reduction algorithms for structured combinatorial optimization problems (Q1373458) (← links)
- A potential reduction approach to the frequency assignment problem (Q1377670) (← links)
- A simple duality proof in convex quadratic programming with a quadratic constraint, and some applications (Q1576348) (← links)
- Convex envelopes of separable functions over regions defined by separable functions of the same type (Q1634777) (← links)
- A linear-time algorithm for the trust region subproblem based on hidden convexity (Q1686552) (← links)
- Hidden convexity in some nonconvex quadratically constrained quadratic programming (Q1919813) (← links)
- An accelerated first-order method with complexity analysis for solving cubic regularization subproblems (Q2044484) (← links)
- Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension (Q2045012) (← links)
- Strong duality for general quadratic programs with quadratic equality constraints (Q2082247) (← links)
- A survey of hidden convex optimization (Q2176821) (← links)
- Cubic regularization methods with second-order complexity guarantee based on a new subproblem reformulation (Q2676160) (← links)
- A notion of compliance robustness in topology optimization (Q2798003) (← links)
- Novel Reformulations and Efficient Algorithms for the Generalized Trust Region Subproblem (Q5231678) (← links)
- Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem (Q5870365) (← links)
- LMI approximations for the radius of the intersection of ellipsoids: Survey. (Q5929424) (← links)
- Invariants of SDP exactness in quadratic programming (Q6184179) (← links)