Recent advances in trust region algorithms
Y Yuan - Mathematical Programming, 2015 - Springer
Trust region methods are a class of numerical methods for optimization. Unlike line search
type methods where a line search is carried out in each iteration, trust region methods …
type methods where a line search is carried out in each iteration, trust region methods …
[PDF][PDF] A review of trust region algorithms for optimization
Y Yuan - Iciam, 2000 - bison.ihep.su
Iterative methods for optimization can be classified into two categories: line search methods
and trust region methods. In this paper we give a review on trust region algorithms for …
and trust region methods. In this paper we give a review on trust region algorithms for …
[图书][B] Semismooth Newton methods for variational inequalities and constrained optimization problems in function spaces
M Ulbrich - 2011 - SIAM
This book provides a comprehensive treatment of a very successful class of methods for
solving optimization problems with PDE and inequality constraints as well as variational …
solving optimization problems with PDE and inequality constraints as well as variational …
Some noninterior continuation methods for linear complementarity problems
C Kanzow - SIAM Journal on Matrix Analysis and Applications, 1996 - SIAM
We introduce some new path-following methods for the solution of the linear
complementarity problem. We call these methods noninterior continuation methods since, in …
complementarity problem. We call these methods noninterior continuation methods since, in …
Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
YH Dai, R Fletcher - Numerische Mathematik, 2005 - Springer
This paper studies projected Barzilai-Borwein (PBB) methods for large-scale box-
constrained quadratic programming. Recent work on this method has modified the PBB …
constrained quadratic programming. Recent work on this method has modified the PBB …
A semismooth equation approach to the solution of nonlinear complementarity problems
T De Luca, F Facchinei, C Kanzow - Mathematical programming, 1996 - Springer
In this paper we present a new algorithm for the solution of nonlinear complementarity
problems. The algorithm is based on a semismooth equation reformulation of the …
problems. The algorithm is based on a semismooth equation reformulation of the …
An open-source unconstrained stress updating algorithm for the modified Cam-clay model
This paper presents an unconstrained stress updating algorithm for a critical state plastic
model of clay soil, where the loading/unloading estimations and the consideration of the …
model of clay soil, where the loading/unloading estimations and the consideration of the …
A new active set algorithm for box constrained optimization
An active set algorithm (ASA) for box constrained optimization is developed. The algorithm
consists of a nonmonotone gradient projection step, an unconstrained optimization step, and …
consists of a nonmonotone gradient projection step, an unconstrained optimization step, and …
[图书][B] Numerische Verfahren zur Lösung unrestringierter Optimierungsaufgaben
C Geiger, C Kanzow - 2013 - books.google.com
Dieses Buch bietet eine umfassende und aktuelle Darstellung des Themenbereichs"
Numerische Lösung unrestringierter Optimierungsaufgaben mit differenzierbarer …
Numerische Lösung unrestringierter Optimierungsaufgaben mit differenzierbarer …
On the nonmonotone line search
YH Dai - Journal of Optimization Theory and Applications, 2002 - Springer
The technique of nonmonotone line search has received many successful applications and
extensions in nonlinear optimization. This paper provides some basic analyses of the …
extensions in nonlinear optimization. This paper provides some basic analyses of the …