The following pages link to LANCELOT (Q13256):
Displaying 50 items.
- Quasi-Newton acceleration for equality-constrained minimization (Q1001193) (← links)
- Recognizing underlying sparsity in optimization (Q1013977) (← links)
- A penalty-function-free line search SQP method for nonlinear programming (Q1019803) (← links)
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results (Q1266208) (← links)
- On proving existence of feasible points in equality constrained optimization problems (Q1290652) (← links)
- A shifted-barrier primal-dual algorithm model for linearly constrained optimization problems (Q1294812) (← links)
- An interior-point algorithm for nonconvex nonlinear programming (Q1294828) (← links)
- Global convergence of QPFTH method for large-scale nonlinear sparse constrained optimization (Q1302267) (← links)
- Modifying the inertia of matrices arising in optimization (Q1307208) (← links)
- Modifications to the subroutine OPALQP for dealing with large problems (Q1309843) (← links)
- A projected conjugate gradient method for sparse minimax problems (Q1315210) (← links)
- A new trust region algorithm for bound constrained minimization (Q1337095) (← links)
- Corrected sequential linear programming for sparse minimax optimization (Q1338528) (← links)
- A note on exploiting structure when using slack variables (Q1340068) (← links)
- Impact of partial separability on large-scale optimization (Q1363059) (← links)
- On the number of inner iterations per outer iteration of a globally convergent algorithm for optimization with general nonlinear inequality constraints and simple bounds (Q1363060) (← links)
- Numerical experiences with new truncated Newton methods in large scale unconstrained optimization (Q1363061) (← links)
- Sequential quadratic programming methods for large-scale problems (Q1363065) (← links)
- Interactions between nonlinear programming and modeling systems (Q1365050) (← links)
- Recent progress in unconstrained nonlinear optimization without derivatives (Q1365064) (← links)
- Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints (Q1373760) (← links)
- Non-monotone trust region methods for nonlinear equality constrained optimization without a penalty function (Q1411634) (← links)
- Mathematical reliability: an expository perspective. (Q1422041) (← links)
- Application of shakedown analysis to the plastic design of composites (Q1566493) (← links)
- Nonlinear programming algorithms using trust regions and augmented Lagrangians with nonmonotone penalty parameters. (Q1572667) (← links)
- Solving elliptic control problems with interior point and SQP methods: Control and state constraints (Q1578854) (← links)
- Theoretical efficiency of an inexact Newton method (Q1579635) (← links)
- Validation of an augmented Lagrangian algorithm with a Gauss-Newton Hessian approximation using a set of hard-spheres problems (Q1588830) (← links)
- A survey of truncated-Newton methods (Q1593812) (← links)
- On the behavior of the gradient norm in the steepest descent method (Q1610310) (← links)
- On the rate of convergence of sequential quadratic programming with nondifferentiable exact penalty function in the presence of constraint degeneracy (Q1611011) (← links)
- Stabilized optimization via an NCL algorithm (Q1627491) (← links)
- A hybrid of adjustable trust-region and nonmonotone algorithms for unconstrained optimization (Q1630201) (← links)
- OPTIMASS: a package for the minimization of kinematic mass functions with constraints (Q1638086) (← links)
- A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms (Q1639726) (← links)
- Best practices for comparing optimization algorithms (Q1642983) (← links)
- A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm (Q1650852) (← links)
- An SR1/BFGS SQP algorithm for nonconvex nonlinear programs with block-diagonal Hessian matrix (Q1694296) (← links)
- The flattened aggregate constraint homotopy method for nonlinear programming problems with many nonlinear constraints (Q1724113) (← links)
- Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm (Q1754299) (← links)
- A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization (Q1769069) (← links)
- Augmented Lagrangian algorithms based on the spectral projected gradient method for solving nonlinear programming problems (Q1770091) (← links)
- Nonmonotone strategy for minimization of quadratics with simple constraints. (Q1771833) (← links)
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs (Q1780950) (← links)
- An inexact Newton method derived from efficiency analysis (Q1781970) (← links)
- A new augmented Lagrangian method for equality constrained optimization with simple unconstrained subproblem (Q1784887) (← links)
- A decomposition approach for the fuel-constrained economic power-dispatch problem (Q1806924) (← links)
- A truncated Newton method for the solution of large-scale inequality constrained minimization problems (Q1810970) (← links)
- Nonmonotone curvilinear line search methods for unconstrained optimization (Q1816399) (← links)
- Elastic plastic shakedown of 3D periodic heterogeneous media: a direct numerical approach (Q1827624) (← links)
