The following pages link to LANCELOT (Q13256):
Displaying 50 items.
- (Q3516592) (← links)
- Solving Large-Scale Nonlinear Programming Problems by Constraint Partitioning (Q3524213) (← links)
- Evaluating Derivatives (Q3532974) (← links)
- Improving ultimate convergence of an augmented Lagrangian method (Q3539788) (← links)
- Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations (Q3539803) (← links)
- On Augmented Lagrangian Methods with General Lower-Level Constraints (Q3544262) (← links)
- Numerical experience with a recursive trust-region method for multilevel nonlinear bound-constrained optimization (Q3562407) (← links)
- Models of Non-atomic Congestion Games – From Unicast to Multicast Routing (Q3637323) (← links)
- An MPCC approach on a Stackelberg game in an electric power market: changing the leadership (Q3643179) (← links)
- On the Implementation of an Algorithm for Large-Scale Equality Constrained Optimization (Q4210326) (← links)
- A Trust Region Method for Nonlinear Programming Based on Primal Interior-Point Techniques (Q4210415) (← links)
- Algorithm 778: L-BFGS-B (Q4223464) (← links)
- Curvilinear Stabilization Techniques for Truncated Newton Methods in Large Scale Unconstrained Optimization (Q4229454) (← links)
- Fuzzy logic and neural networks for design of process parameters: A grinding process application (Q4245511) (← links)
- (Q4303369) (← links)
- On Smoothing Exact Penalty Functions for Convex Constrained Optimization (Q4308550) (← links)
- (Q4308912) (← links)
- Computing Gradients in Large-Scale Optimization Using Automatic Differentiation (Q4354939) (← links)
- (Q4358712) (← links)
- CUTE (Q4371578) (← links)
- LSNNO, a FORTRAN subroutine for solving large-scale nonlinear network optimization problems (Q4371805) (← links)
- A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization (Q4372656) (← links)
- Engineering and Economic Applications of Complementarity Problems (Q4376201) (← links)
- Automatic Determination of an Initial Trust Region in Nonlinear Programming (Q4376255) (← links)
- An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints (Q4389186) (← links)
- An Efficient Algorithm for Large-Scale Nonlinear Programming Problems with Simple Bounds on the Variables (Q4389204) (← links)
- NITSOL: A Newton Iterative Solver for Nonlinear Systems (Q4389244) (← links)
- (Q4400817) (← links)
- (Q4421360) (← links)
- (Q4427728) (← links)
- (Q4433920) (← links)
- Augmented Lagrangians with Adaptive Precision Control for Quadratic Programming with Simple Bounds and Equality Constraints (Q4441940) (← links)
- (Q4464624) (← links)
- (Q4464628) (← links)
- A mathematical view of automatic differentiation (Q4465274) (← links)
- (Q4495124) (← links)
- Einspielanalyse von Verbundwerkstoffen (Q4498744) (← links)
- Degenerate Nonlinear Programming with a Quadratic Growth Condition (Q4509754) (← links)
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets (Q4509759) (← links)
- An interface optimization and application for the numerical solution of optimal control problems (Q4512814) (← links)
- C++ classes for linking optimization with complex simulations (Q4512815) (← links)
- (Q4524222) (← links)
- A generalized proximal-point method for convex optimization problems in Hilbert spaces (Q4598825) (← links)
- A Newton-Based Method for Nonconvex Optimization with Fast Evasion of Saddle Points (Q4620423) (← links)
- Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities (Q4634141) (← links)
- A Multidimensional Filter Algorithm for Nonlinear Equations and Nonlinear Least-Squares (Q4651993) (← links)
- First-Order Approximation and Model Management in Optimization (Q4654831) (← links)
- (Q4654838) (← links)
- On the efficiency of multiplier methods for nonlinear network problems with nonlinear constraints (Q4659863) (← links)
- (Q4681781) (← links)
