Pages that link to "Item:Q4838957"

The following pages link to Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations (Q4838957):

Displaying 50 items.

• S-lemma with equality and its applications (Q263215) (← links)
• Global optimality conditions for nonconvex minimization problems with quadratic constraints (Q265137) (← links)
• Trust region subproblem with an additional linear inequality constraint (Q276335) (← links)
• A linear-time algorithm for trust region problems (Q304248) (← links)
• On zero duality gap in nonconvex quadratic programming problems (Q421278) (← links)
• The generalized trust region subproblem (Q457202) (← links)
• Strong duality for generalized trust region subproblem: S-lemma with interval bounds (Q497446) (← links)
• Second-order analysis of penalty function (Q604260) (← links)
• Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems (Q620513) (← links)
• An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem (Q623464) (← links)
• Duality and solutions for quadratic programming over single non-homogeneous quadratic constraint (Q693140) (← links)
• Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
• Kalman-Popov-Yakubovich Lemma and the \(S\)-procedure: a historical essay (Q885768) (← links)
• On the convexity of a class of quadratic mappings and its application to the problem of finding the smallest ball enclosing a given intersection of balls (Q946350) (← links)
• Regularization using a parameterized trust region subproblem (Q959940) (← links)
• Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions (Q985310) (← links)
• A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid (Q1016108) (← links)
• Convexity properties associated with nonconvex quadratic matrix functions and applications to quadratic programming (Q1035905) (← links)
• Matrix pencils and existence conditions for quadratic programming with a sign-indefinite quadratic equality constraint (Q1041439) (← links)
• Inversion error, condition number, and approximate inverses of uncertain matrices (Q1348090) (← links)
• On piecewise quadratic Newton and trust region problems (Q1356055) (← links)
• Difference of convex functions optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres (Q1362986) (← links)
• Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem (Q1602704) (← links)
• SOCP reformulation for the generalized trust region subproblem via a canonical form of two symmetric matrices (Q1646573) (← links)
• An efficient algorithm for solving the generalized trust region subproblem (Q1655384) (← links)
• Quadratic programs with hollows (Q1659682) (← links)
• A linear-time algorithm for the trust region subproblem based on hidden convexity (Q1686552) (← links)
• Lagrangian decomposition of block-separable mixed-integer all-quadratic programs (Q1771303) (← links)
• Strengthened existence and uniqueness conditions for search directions in semidefinite program\-ming (Q1779251) (← links)
• Some results for quadratic problems with one or two quadratic constraints (Q1785624) (← links)
• A note on lack of strong duality for quadratic problems with orthogonal constraints (Q1848387) (← links)
• A trust-region strategy for minimization on arbitrary domains (Q1890927) (← links)
• Hidden convexity in some nonconvex quadratically constrained quadratic programming (Q1919813) (← links)
• Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty (Q1941033) (← links)
• Convexity of quadratic transformations and its use in control and optimization (Q1969525) (← links)
• Noisy Euclidean distance matrix completion with a single missing node (Q2010104) (← links)
• Lower bounds for cubic optimization over the sphere (Q2031942) (← links)
• Global optimality condition for quadratic optimization problems under data uncertainty (Q2045908) (← links)
• Strong duality for general quadratic programs with quadratic equality constraints (Q2082247) (← links)
• \(\rho\)-regularization subproblems: strong duality and an eigensolver-based algorithm (Q2114814) (← links)
• The generalized trust region subproblem: solution complexity and convex hull results (Q2118085) (← links)
• On the local stability of semidefinite relaxations (Q2144546) (← links)
• On Lagrangian duality gap of quadratic fractional programming with a two-sided quadratic constraint (Q2174902) (← links)
• A survey of hidden convex optimization (Q2176821) (← links)
• On the complexity of quadratic programming with two quadratic constraints (Q2364486) (← links)
• Hidden conic quadratic representation of some nonconvex quadratic optimization problems (Q2436648) (← links)
• Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints (Q2471081) (← links)
• Auxiliary signal design for active failure detection in uncertain linear systems with a priori information (Q2491904) (← links)
• Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow (Q2689820) (← links)
• A notion of compliance robustness in topology optimization (Q2798003) (← links)