Local nonglobal minima for solving large-scale extended trust-region subproblems
From MaRDI portal
Publication:513712
DOI10.1007/s10589-016-9867-4zbMath1391.90496arXiv1512.07628OpenAlexW2203411556MaRDI QIDQ513712
Maziar Salahi, Akram Taati, Henry Wolkowicz
Publication date: 7 March 2017
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.07628
large-scale optimizationgeneralized eigenvalue problemlinear inequality constrainttrust-region subproblem
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)
Related Items
An efficient algorithm for the extended trust-region subproblem with two linear constraints, On Local Minimizers of Nonconvex Homogeneous Quadratically Constrained Quadratic Optimization with at Most Two Constraints, An active-set algorithm for norm constrained quadratic problems, Refined bounds on the convergence of block Lanczos method for extended trust-region subproblem, On indefinite quadratic optimization over the intersection of balls and linear constraints, A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants, Exact two steps SOCP/SDP formulation for a modified conic trust region subproblem, On Local Non-Global Minimizers of Quadratic Optimization Problem with a Single Quadratic Constraint, Closing the Gap between Necessary and Sufficient Conditions for Local Nonglobal Minimizer of Trust Region Subproblem, Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint, A Block Lanczos Method for the Extended Trust-Region Subproblem, An iterative algorithm for the conic trust region subproblem, A hybrid algorithm for the two-trust-region subproblem, Tilt stability for quadratic programs with one or two quadratic inequality constraints, Quadratic optimization with two ball constraints, On local nonglobal minimum of trust-region subproblem and extension
Uses Software
Cites Work
- Unnamed Item
- Trust region subproblem with an additional linear inequality constraint
- Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
- Introduction to sensitivity and stability analysis in nonlinear programming
- On solving trust-region and other regularised subproblems in optimization
- A semidefinite framework for trust region subproblems with applications to large scale minimization
- A fast eigenvalue approach for solving the trust region subproblem with an additional linear inequality
- A New Matrix-Free Algorithm for the Large-Scale Trust-Region Subproblem
- Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem
- Accelerating the LSTRS Algorithm
- Computing a Trust Region Step
- Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
- Computing Optimal Locally Constrained Steps
- Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
- On Some Properties of Quadratic Programs with a Convex Quadratic Constraint
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Trust Region Methods
- Global convergence of SSM for minimizing a quadratic over a sphere
- The trust region subproblem and semidefinite programming*
- Second-Order-Cone Constraints for Extended Trust-Region Subproblems
