An iterative algorithm for the conic trust region subproblem
From MaRDI portal
Publication:1791853
DOI10.1007/s40819-016-0254-8zbMath1397.90373OpenAlexW2525911200MaRDI QIDQ1791853
Publication date: 11 October 2018
Published in: International Journal of Applied and Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40819-016-0254-8
Numerical mathematical programming methods (65K05) Fractional programming (90C32) Methods of quasi-Newton type (90C53)
Related Items (1)
Cites Work
- Local nonglobal minima for solving large-scale extended trust-region subproblems
- Celis-Dennis-Tapia based approach to quadratic fractional programming problems with two quadratic constraints
- A conic trust-region method and its convergence properties
- A semidefinite framework for trust region subproblems with applications to large scale minimization
- Exact two steps SOCP/SDP formulation for a modified conic trust region subproblem
- Parametric approach for solving quadratic fractional optimization with a linear and a quadratic constraint
- A quasi-Newton trust region method with a new conic model for the unconstrained optimization
- Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem
- An adaptive conic trust-region method for unconstrained optimization
- Conic Approximations and Collinear Scalings for Optimizers
- Trust Region Methods
- The trust region subproblem and semidefinite programming*
- Second-Order-Cone Constraints for Extended Trust-Region Subproblems
- Optimality Conditions for Trust-Region Subproblems Involving a Conic Model
- On Nonlinear Fractional Programming
- A conic trust-region method for nonlinearly constrained optimization
This page was built for publication: An iterative algorithm for the conic trust region subproblem
