LANCELOT

LANCELOT. A Fortran package for large-scale nonlinear optimization (Release A). LANCELOT is a software package for solving large-scale nonlinear optimization problems. This book provides a coherent overview of the package and its use. In particular, it contains a proposal for a standard input for problems and the LANCELOT optimization package. Although the book is primarily concerned with a specific optimization package, the issues discussed have much wider implications for the design and implementation of large-scale optimization algorithms.


References in zbMATH (referenced in 293 articles , 3 standard articles )

Showing results 1 to 20 of 293.
Sorted by year (citations)

1 2 3 ... 13 14 15 next

  1. Galabova, I. L.; Hall, J. A. J.: The `Idiot’ crash quadratic penalty algorithm for linear programming and its application to linearizations of quadratic assignment problems (2020)
  2. Gratton, S.; Toint, Ph. L.: A note on solving nonlinear optimization problems in variable precision (2020)
  3. Armand, Paul; Tran, Ngoc Nguyen: An augmented Lagrangian method for equality constrained optimization with rapid infeasibility detection capabilities (2019)
  4. Chen, Xiaojun; Toint, Ph. L.; Wang, H.: Complexity of partially separable convexly constrained optimization with non-Lipschitzian singularities (2019)
  5. Englert, Tobias; Völz, Andreas; Mesmer, Felix; Rhein, Sönke; Graichen, Knut: A software framework for embedded nonlinear model predictive control using a gradient-based augmented Lagrangian approach (GRAMPC) (2019)
  6. Hante, Falk M.; Schmidt, Martin: Complementarity-based nonlinear programming techniques for optimal mixing in gas networks (2019)
  7. Paternain, Santiago; Mokhtari, Aryan; Ribeiro, Alejandro: A Newton-based method for nonconvex optimization with fast evasion of saddle points (2019)
  8. Ri, Jun-Hyok; Hong, Hyon-Sik: A basis reduction method using proper orthogonal decomposition for shakedown analysis of kinematic hardening material (2019)
  9. Wang, Guoqiang; Yu, Bo: PAL-Hom method for QP and an application to LP (2019)
  10. Amaioua, Nadir; Audet, Charles; Conn, Andrew R.; Le Digabel, Sébastien: Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm (2018)
  11. Birgin, E. G.; Haeser, G.; Ramos, Alberto: Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points (2018)
  12. Caliciotti, Andrea; Fasano, Giovanni; Nash, Stephen G.; Roma, Massimo: An adaptive truncation criterion, for linesearch-based truncated Newton methods in large scale nonconvex optimization (2018)
  13. Haeser, Gabriel: A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms (2018)
  14. Kuhlmann, Renke; Büskens, Christof: A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm (2018)
  15. Ma, Ding; Judd, Kenneth L.; Orban, Dominique; Saunders, Michael A.: Stabilized optimization via an NCL algorithm (2018)
  16. Armand, Paul; Omheni, Riadh: A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization (2017)
  17. Beiranvand, Vahid; Hare, Warren; Lucet, Yves: Best practices for comparing optimization algorithms (2017)
  18. Zhang, Hao; Ni, Qin: A new augmented Lagrangian method for equality constrained optimization with simple unconstrained subproblem (2017)
  19. Arreckx, Sylvain; Lambe, Andrew; Martins, Joaquim R. R. A.; Orban, Dominique: A matrix-free augmented Lagrangian algorithm with application to large-scale structural design optimization (2016)
  20. Birgin, E. G.; Bueno, L. F.; Martínez, J. M.: Sequential equality-constrained optimization for nonlinear programming (2016)

1 2 3 ... 13 14 15 next