LANCELOT
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Quasi-Newton acceleration for equality-constrained minimization
- Recognizing underlying sparsity in optimization
- A penalty-function-free line search SQP method for nonlinear programming
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- On proving existence of feasible points in equality constrained optimization problems
- A shifted-barrier primal-dual algorithm model for linearly constrained optimization problems
- An interior-point algorithm for nonconvex nonlinear programming
- Global convergence of QPFTH method for large-scale nonlinear sparse constrained optimization
- Modifying the inertia of matrices arising in optimization
- Modifications to the subroutine OPALQP for dealing with large problems
- GLOPT
- A projected conjugate gradient method for sparse minimax problems
- Hilbert class library
- KNITRO
- LSNNO
- A new trust region algorithm for bound constrained minimization
- NITSOL
- Corrected sequential linear programming for sparse minimax optimization
- A note on exploiting structure when using slack variables
- ODRPACK
- PCOMP
- QPCOMP
- QPDO
- Impact of partial separability on large-scale optimization
- On the number of inner iterations per outer iteration of a globally convergent algorithm for optimization with general nonlinear inequality constraints and simple bounds
- Numerical experiences with new truncated Newton methods in large scale unconstrained optimization
- Sequential quadratic programming methods for large-scale problems
- SPG
- Interactions between nonlinear programming and modeling systems
- Recent progress in unconstrained nonlinear optimization without derivatives
- STRSCNE
- TENSOLVE
- TNPACK
- Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints
- L-BFGS-B
- Non-monotone trust region methods for nonlinear equality constrained optimization without a penalty function
- GALAHAD
- Mathematical reliability: an expository perspective.
- ADIFOR
- LOQO
- SNOPT
- CONOPT
- Application of shakedown analysis to the plastic design of composites
- Nonlinear programming algorithms using trust regions and augmented Lagrangians with nonmonotone penalty parameters.
- L-BFGS
- Solving elliptic control problems with interior point and SQP methods: Control and state constraints
- Theoretical efficiency of an inexact Newton method
- Validation of an augmented Lagrangian algorithm with a Gauss-Newton Hessian approximation using a set of hard-spheres problems
- A survey of truncated-Newton methods
- On the behavior of the gradient norm in the steepest descent method
- On the rate of convergence of sequential quadratic programming with nondifferentiable exact penalty function in the presence of constraint degeneracy
- AMPL
- CUTEr
- SIFDecode
- Stabilized optimization via an NCL algorithm
- A hybrid of adjustable trust-region and nonmonotone algorithms for unconstrained optimization
- OPTIMASS: a package for the minimization of kinematic mass functions with constraints
- A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms
- Best practices for comparing optimization algorithms
- QPA
- A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm
- PENNON
- GGPLAB
- Slatec
- TRON
- filterSQP
- PPRN
- DONLP2
- MINPACK-2
- TANGO
- DIRCOL
- ipfilter
- An SR1/BFGS SQP algorithm for nonconvex nonlinear programs with block-diagonal Hessian matrix
- PLCP
- CG_DESCENT
- MIQPBB
- OPALQP
- CDFCOR
- BIOGEME
- MINOS
- The flattened aggregate constraint homotopy method for nonlinear programming problems with many nonlinear constraints
- MINQ
- tn
- ve08
- NLPHOPDM
- FFSQP(f77)
- HQP/OMUSES
- nlpy
- ALGENCAN
- SQPlab
- PFNRN
- Filtrane
- TRICE
- PORT
- CG+
- minpack
- Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm
- A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization
- Augmented Lagrangian algorithms based on the spectral projected gradient method for solving nonlinear programming problems
- Nonmonotone strategy for minimization of quadratics with simple constraints.
This page was built for software: LANCELOT
