Closing the gap between necessary and sufficient conditions for local nonglobal minimizer of trust region subproblem
From MaRDI portal
Publication:5116545
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
Cites work
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 3903874 (Why is no real title available?)
- scientific article; zbMATH DE number 3912096 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- 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 linear-time algorithm for trust region problems
- A second-order cone based approach for solving the trust-region subproblem and its variants
- A semidefinite framework for trust region subproblems with applications to large scale minimization
- A survey of hidden convex optimization
- Checking local optimality in constrained quadratic programming is NP- hard
- Computing Optimal Locally Constrained Steps
- Computing a Trust Region Step
- Globally solving extended trust region subproblems with two intersecting cuts
- Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
- Local nonglobal minima for solving large-scale extended trust-region subproblems
- Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
- New Results on Quadratic Minimization
- Newton’s Method with a Model Trust Region Modification
- On Cones of Nonnegative Quadratic Functions
- Open questions in complexity theory for numerical optimization
- Polynomial Solvability of Variants of the Trust-Region Subproblem
- Second-order-cone constraints for extended trust-region subproblems
- Solving the Trust-Region Subproblem using the Lanczos Method
- Solving the trust-region subproblem by a generalized eigenvalue problem
- Some NP-complete problems in quadratic and nonlinear programming
- The trust region subproblem with non-intersecting linear constraints
- Trust Region Methods
Cited in
(8)- On local nonglobal minimum of trust-region subproblem and extension
- Sufficient conditions for error distance reduction in the \(\ell^2\)-norm trust region between minimizers of local nonconvex multivariate quadratic approximates
- Computing the Local-Nonglobal Minimizer of a Large Scale Trust-Region Subproblem
- Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem
- On Local Minimizers of Nonconvex Homogeneous Quadratically Constrained Quadratic Optimization with at Most Two Constraints
- Linear Programming on the Stiefel Manifold
- Sharp and Fast Bounds for the Celis-Dennis-Tapia Problem
- Globally solving the trust region subproblem using simple first-order methods
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)
