The following pages link to (Q3681854):
Displaying 35 items.
- Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming (Q2274889) (← links)
- Large-scale quasi-Newton trust-region methods with low-dimensional linear equality constraints (Q2282813) (← links)
- Strong duality in minimizing a quadratic form subject to two homogeneous quadratic inequalities over the unit sphere (Q2301183) (← links)
- A subspace SQP method for equality constrained optimization (Q2322557) (← links)
- A hybrid algorithm for the two-trust-region subproblem (Q2322760) (← links)
- Recent advances in trust region algorithms (Q2349124) (← links)
- On the complexity of quadratic programming with two quadratic constraints (Q2364486) (← links)
- CDT like approaches for the system of nonlinear equations (Q2369234) (← links)
- Krylov subspace recycling for sequences of shifted linear systems (Q2451760) (← links)
- A trust-region method by active-set strategy for general nonlinear optimization (Q2460581) (← links)
- An affine scaling projective reduced Hessian algorithm for minimum optimization with nonlinear equality and linear inequality constraints (Q2485615) (← links)
- A feasible trust-region algorithm for inequality constrained optimization (Q2489190) (← links)
- A penalty-free-type nonmonotone trust-region method for nonlinear constrained optimization (Q2489456) (← links)
- The trust region subproblem with non-intersecting linear constraints (Q2515041) (← links)
- On a globally convergent trust region algorithm with infeasibility control for equality constrained optimization (Q2634338) (← links)
- Numerical comparison of merit function with filter criterion in inexact restoration algorithms using hard-spheres problems (Q2655405) (← links)
- Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow (Q2689820) (← links)
- A Note on Polynomial Solvability of the CDT Problem (Q2789609) (← links)
- A Two-Variable Approach to the Two-Trust-Region Subproblem (Q2796795) (← links)
- Simultaneous Diagonalization of Matrices and Its Applications in Quadratically Constrained Quadratic Programming (Q2817836) (← links)
- Solving Generalized CDT Problems via Two-Parameter Eigenvalues (Q2817837) (← links)
- Kronecker Product Constraints with an Application to the Two-Trust-Region Subproblem (Q2968177) (← links)
- Optimization Algorithms (Q3020435) (← links)
- Computing the Signed Distance Between Overlapping Ellipsoids (Q3454510) (← links)
- The solution of euclidean norm trust region SQP subproblems via second-order cone programs: an overview and elementary introduction (Q4638912) (← links)
- Global convergence of SSM for minimizing a quadratic over a sphere (Q4671844) (← links)
- Closing the Gap between Necessary and Sufficient Conditions for Local Nonglobal Minimizer of Trust Region Subproblem (Q5116545) (← links)
- A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants (Q5348458) (← links)
- New Results on Narrowing the Duality Gap of the Extended Celis--Dennis--Tapia Problem (Q5737733) (← links)
- An Optimality Gap Test for a Semidefinite Relaxation of a Quadratic Program with Two Quadratic Constraints (Q5857291) (← links)
- On Local Minimizers of Nonconvex Homogeneous Quadratically Constrained Quadratic Optimization with at Most Two Constraints (Q5883323) (← links)
- A partial ellipsoidal approximation scheme for nonconvex homogeneous quadratic optimization with quadratic constraints (Q6093405) (← links)
- Sharp and Fast Bounds for the Celis-Dennis-Tapia Problem (Q6161303) (← links)
- An efficient splitting algorithm for solving the CDT subproblem (Q6561567) (← links)
- Solving two-trust-region subproblems using semidefinite optimization with eigenvector branching (Q6596338) (← links)
