Closing the gap between necessary and sufficient conditions for local nonglobal minimizer of trust region subproblem
DOI10.1137/19M1294459zbMATH Open1491.90115OpenAlexW3046882415MaRDI QIDQ5116545FDOQ5116545
Authors: Jiulin Wang, Yong Xia 
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
Recommendations
- On local nonglobal minimum of trust-region subproblem and extension
- Computing the Local-Nonglobal Minimizer of a Large Scale Trust-Region Subproblem
- Globally solving the trust region subproblem using simple first-order methods
- A necessary and sufficient condition of convexity for SOC reformulation of trust-region subproblem with two intersecting cuts
- Local nonglobal minima for solving large-scale extended trust-region subproblems
optimality conditiongeneralized eigenvalue problempolynomial solvabilitylocal minimizertrust region subproblem
Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Cites Work
- Computing a Trust Region Step
- Solving the Trust-Region Subproblem using the Lanczos Method
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some NP-complete problems in quadratic and nonlinear programming
- Trust Region Methods
- New Results on Quadratic Minimization
- On Cones of Nonnegative Quadratic Functions
- The trust region subproblem with non-intersecting linear constraints
- Second-Order-Cone Constraints for Extended Trust-Region Subproblems
- Title not available (Why is that?)
- Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
- A semidefinite framework for trust region subproblems with applications to large scale minimization
- A linear-time algorithm for trust region problems
- Computing Optimal Locally Constrained Steps
- Newton’s Method with a Model Trust Region Modification
- Title not available (Why is that?)
- Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
- Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem
- 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 branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints
- A survey of hidden convex optimization
- Polynomial Solvability of Variants of the Trust-Region Subproblem
- A linear-time algorithm for the trust region subproblem based on hidden convexity
- A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants
- Globally solving extended trust region subproblems with two intersecting cuts
Cited In (6)
- Sharp and Fast Bounds for the Celis-Dennis-Tapia Problem
- On Local Minimizers of Nonconvex Homogeneous Quadratically Constrained Quadratic Optimization with at Most Two Constraints
- Computing the Local-Nonglobal Minimizer of a Large Scale Trust-Region Subproblem
- Linear Programming on the Stiefel Manifold
- Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem
- On local nonglobal minimum of trust-region subproblem and extension
Uses Software
This page was built for publication: Closing the gap between necessary and sufficient conditions for local nonglobal minimizer of trust region subproblem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5116545)
