Closing the Gap between Necessary and Sufficient Conditions for Local Nonglobal Minimizer of Trust Region Subproblem
From MaRDI portal
Publication:5116545
DOI10.1137/19M1294459zbMath1491.90115OpenAlexW3046882415MaRDI QIDQ5116545
Publication date: 18 August 2020
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/19m1294459
generalized eigenvalue problemoptimality conditionlocal minimizerpolynomial solvabilitytrust region subproblem
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46)
Related Items (5)
On Local Minimizers of Nonconvex Homogeneous Quadratically Constrained Quadratic Optimization with at Most Two Constraints ⋮ Sharp and Fast Bounds for the Celis-Dennis-Tapia Problem ⋮ Linear Programming on the Stiefel Manifold ⋮ On local nonglobal minimum of trust-region subproblem and extension ⋮ Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A linear-time algorithm for trust region problems
- Local nonglobal minima for solving large-scale extended trust-region subproblems
- Open questions in complexity theory for numerical optimization
- Checking local optimality in constrained quadratic programming is NP- hard
- A semidefinite framework for trust region subproblems with applications to large scale minimization
- A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints
- A linear-time algorithm for the trust region subproblem based on hidden convexity
- A survey of hidden convex optimization
- Globally solving extended trust region subproblems with two intersecting cuts
- Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
- The trust region subproblem with non-intersecting linear constraints
- Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem
- Computing a Trust Region Step
- Some NP-complete problems in quadratic and nonlinear programming
- Computing Optimal Locally Constrained Steps
- Newton’s Method with a Model Trust Region Modification
- Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
- New Results on Quadratic Minimization
- Trust Region Methods
- Solving the Trust-Region Subproblem using the Lanczos Method
- Second-Order-Cone Constraints for Extended Trust-Region Subproblems
- A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants
- Polynomial Solvability of Variants of the Trust-Region Subproblem
- On Cones of Nonnegative Quadratic Functions
This page was built for publication: Closing the Gap between Necessary and Sufficient Conditions for Local Nonglobal Minimizer of Trust Region Subproblem
