Numerical experiments with the Lancelot package (Release A) for large-scale nonlinear optimization
From MaRDI portal
Publication:1915809
DOI10.1007/BF02592099zbMATH Open0848.90109MaRDI QIDQ1915809FDOQ1915809
Philippe 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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- LSNNO, a FORTRAN subroutine for solving large-scale nonlinear network optimization problems
- Testing Unconstrained Optimization Software
- CUTE
- The performance of NLPNET, a large-scale nonlinear network optimizer
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- Projected gradient methods for linearly constrained problems
- A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds
- More test examples for nonlinear programming codes
- Test examples for nonlinear programming codes
- Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space
- 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
- Convergence properties of trust region methods for linear and convex constraints
- Elasto-hydrodynamic lubrication: A non-linear complementarity problem
- Preconditioners for Indefinite Systems Arising in Optimization
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- A note on exploiting structure when using slack variables
- A New Modified Cholesky Factorization
- Convergence of Trust Region Algorithms for Optimization with Bounds when Strict Complementarity Does Not Hold
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- On the Automatic Scaling of Matrices for Gaussian Elimination
- Convergence Properties of Minimization Algorithms for Convex Constraints Using a Structured Trust Region
- Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate Gradients
- A Class of Trust Region Methods for Nonlinear Network Optimization Problems
- A primal truncated newton algorithm with application to large-scale nonlinear network optimization
- On large scale nonlinear network optimization
- Modified Cholesky Factorizations for Sparse Preconditioners
Cited In (16)
- A Nonmonotone Filter SQP Method: Local Convergence and Numerical Results
- A trust region method for noisy unconstrained optimization
- Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm
- Sequential Linearization Method for Bound-Constrained Mathematical Programs with Complementarity Constraints
- Theoretical efficiency of an inexact Newton method
- Best practices for comparing optimization algorithms
- Complementarity-based nonlinear programming techniques for optimal mixing in gas networks
- Title not available (Why is that?)
- LANCELOT
- Structured low rank approximation
- Porting a sphere optimization program from LAPACK to ScaLAPACK
- Reverse bridge theorem under constraint partition
- An efficient method for nonlinearly constrained networks
- Adaptive augmented Lagrangian methods: algorithms and practical numerical experience
- Solving mathematical programs with complementarity constraints as nonlinear programs
- Distributed optimal control of nonlinear systems using a second-order augmented Lagrangian method
Uses Software
Recommendations
- Numerical methods for large-scale nonlinear optimization π π
- A numerical study on large-scale nonlinear solvers π π
- Numerical experience with a reduced Hessian method for large scale constrained optimization π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
This page was built for publication: Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1915809)