Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization
From MaRDI portal
Publication:1915809
DOI10.1007/BF02592099zbMath0848.90109MaRDI QIDQ1915809
Phillipe L. Toint, Nick I. M. Gould, Andrew R. Conn
Publication date: 1 July 1996
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)
Related Items
Structured low rank approximation, Best practices for comparing optimization algorithms, A Nonmonotone Filter SQP Method: Local Convergence and Numerical Results, A trust region method for noisy unconstrained optimization, Distributed optimal control of nonlinear systems using a second-order augmented Lagrangian method, Reverse bridge theorem under constraint partition, Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm, An efficient method for nonlinearly constrained networks, Solving mathematical programs with complementarity constraints as nonlinear programs, Complementarity-based nonlinear programming techniques for optimal mixing in gas networks, Adaptive augmented Lagrangian methods: algorithms and practical numerical experience, LANCELOT, Theoretical efficiency of an inexact Newton method, Sequential Linearization Method for Bound-Constrained Mathematical Programs with Complementarity Constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On large scale nonlinear network optimization
- Convergence properties of trust region methods for linear and convex constraints
- More test examples for nonlinear programming codes
- Test examples for nonlinear programming codes
- A note on exploiting structure when using slack variables
- A New Modified Cholesky Factorization
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- Elasto-hydrodynamic lubrication: A non-linear complementarity problem
- Convergence of Trust Region Algorithms for Optimization with Bounds when Strict Complementarity Does Not Hold
- Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- The performance of NLPNET, a large-scale nonlinear network optimizer
- Projected gradient methods for linearly constrained problems
- A primal truncated newton algorithm with application to large-scale nonlinear network optimization
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
- On the Identification of Active Constraints
- Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate Gradients
- Testing Unconstrained Optimization Software
- Preconditioners for Indefinite Systems Arising in Optimization
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- CUTE
- LSNNO, a FORTRAN subroutine for solving large-scale nonlinear network optimization problems
- Convergence Properties of Minimization Algorithms for Convex Constraints Using a Structured Trust Region
- A Class of Trust Region Methods for Nonlinear Network Optimization Problems
- Modified Cholesky Factorizations for Sparse Preconditioners
- On the Automatic Scaling of Matrices for Gaussian Elimination
- A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds
