On fast trust region methods for quadratic models with linear constraints
From MaRDI portal
Publication:499155
DOI10.1007/s12532-015-0084-4zbMath1325.65084OpenAlexW2132492300MaRDI QIDQ499155
Publication date: 30 September 2015
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-015-0084-4
iterative algorithmlinear constraintsconjugate gradientsKrylov subspacesnumerical resulttrust region methodsquadratic models
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56) Quadratic programming (90C20) Interior-point methods (90C51)
Related Items
On the numerical performance of finite-difference-based methods for derivative-free optimization, A progressive barrier derivative-free trust-region algorithm for constrained optimization, On the construction of quadratic models for derivative-free trust-region algorithms, Hermite least squares optimization: a modification of BOBYQA for optimization with limited derivative information, DC optimization for constructing discrete Sugeno integrals and learning nonadditive measures, Black-Box Optimization: Methods and Applications, Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations, Optimization of triple-ring electrodes on piezoceramic transducers using algorithmic differentiation, Derivative-free optimization methods, A Derivative-Free Method for Structured Optimization Problems, An approach for robust PDE-constrained optimization with application to shape optimization of electrical engines and of dynamic elastic structures under uncertainty
Uses Software
Cites Work
- Unnamed Item
- A numerically stable dual method for solving strictly convex quadratic programs
- A memetic algorithm for the generalized traveling salesman problem
- On trust region methods for unconstrained minimization without derivatives
- Least Frobenius norm updating of quadratic models that satisfy interpolation conditions
- Beyond symmetric Broyden for updating quadratic models in minimization without derivatives
- Computing a Trust Region Step
- Newton-type methods for unconstrained and linearly constrained optimization
- Trust Region Methods
- On the Local and Superlinear Convergence of Quasi-Newton Methods
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
