Narrow search
Showing 1 - 10 of 990
Cover Image
The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices
Babaie-Kafaki, Saman; Ghanbari, Reza - In: European journal of operational research : EJOR 234 (2014) 3, pp. 625-630
Persistent link: https://www.econbiz.de/10010360495
Cover Image
A second-order convergence aufmented Lagrangian method using non-quadratic penalty functions
Sánchez, M. D.; Schuverdt, M. L. - In: Opsearch : journal of the Operational Research Society … 56 (2019) 2, pp. 390-408
Persistent link: https://www.econbiz.de/10012027218
Cover Image
An optimal parameter choice for the Dai-Liao family of conjugate gradient methods by avoiding a direction of the maximum magnification by the search direction matrix
Aminifard, Zohre; Babaie-Kafaki, Saman - In: 4OR : a quarterly journal of operations research 17 (2019) 3, pp. 317-330
Persistent link: https://www.econbiz.de/10012109166
Cover Image
On the convergence of inexact augmented Lagrangian methods for problems with convex constraints
Galvan, Giulio; Lapucci, Matteo - In: Operations research letters 47 (2019) 3, pp. 185-189
Persistent link: https://www.econbiz.de/10012017641
Cover Image
An example comparing the standard and safeguarded augmented Lagrangian methods
Kanzow, Christian; Steck, Daniel - In: Operations research letters 45 (2017) 6, pp. 598-603
Persistent link: https://www.econbiz.de/10011782993
Cover Image
Nonconvex Lagrangian-based optimization : monitoring schemes and global convergence
Bolte, Jérôme; Sabach, Shoham; Teboulle, Marc - In: Mathematics of operations research 43 (2018) 4, pp. 1210-1232
Persistent link: https://www.econbiz.de/10011956982
Cover Image
An inexact restoration strategy for the globalization of the sSQP method
Fernández, D.; Pilotta, E.; Torres, G. - In: Computational Optimization and Applications 54 (2013) 3, pp. 595-617
A globally convergent algorithm based on the stabilized sequential quadratic programming (sSQP) method is presented in order to solve optimization problems with equality constraints and bounds. This formulation has attractive features in the sense that constraint qualifications are not needed at...
Persistent link: https://www.econbiz.de/10010998293
Cover Image
A robust trust region method for general constrained optimization
Zhang, Ju-liang - In: Mathematical Methods of Operations Research 60 (2004) 1, pp. 73-85
In this paper, a new trust region method is presented for general constrained optimization problem. In this algorithm, the trial step is obtained by solving two quadratic programming problems with bound constraints. The algorithm is implementable easily. Then we prove that the method is globally...
Persistent link: https://www.econbiz.de/10010950026
Cover Image
A spline smoothing homotopy method for nonlinear programming problems with both inequality and equality constraints
Dong, Li; Zhou, Zhengyong; Yang, Li - In: Mathematical methods of operations research : ZOR 98 (2023) 3, pp. 411-433
Persistent link: https://www.econbiz.de/10014514953
Cover Image
A robust trust region method for general constrained optimization
Zhang, Ju-liang - In: Computational Statistics 60 (2004) 1, pp. 73-85
In this paper, a new trust region method is presented for general constrained optimization problem. In this algorithm, the trial step is obtained by solving two quadratic programming problems with bound constraints. The algorithm is implementable easily. Then we prove that the method is globally...
Persistent link: https://www.econbiz.de/10010759241