The following pages link to LANCELOT (Q13256):
Displayed 50 items.
- Convergence results of an augmented Lagrangian method using the exponential penalty function (Q255069) (← links)
- On an inexact trust-region SQP-filter method for constrained nonlinear optimization (Q263150) (← links)
- A globally convergent penalty-free method for optimization with equality constraints and simple bounds (Q267115) (← links)
- On the application of an augmented Lagrangian algorithm to some portfolio problems (Q285925) (← links)
- Computational comparison of surface metrics for PDE constrained shape optimization (Q302266) (← links)
- An interior-point penalty active-set trust-region algorithm (Q334604) (← links)
- On the multiplier-penalty-approach for quasi-variational inequalities (Q344924) (← links)
- A practical relative error criterion for augmented Lagrangians (Q378086) (← links)
- On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians (Q403098) (← links)
- A direct differentiation formulation of electromechanical sensitivity analysis for rough surfaces in contact (Q424933) (← links)
- Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization (Q429499) (← links)
- On diagonally structured problems in unconstrained optimization using an inexact super Halley method (Q432797) (← links)
- A primal-dual augmented Lagrangian (Q434173) (← links)
- An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints (Q461441) (← links)
- Primal-dual active-set methods for large-scale optimization (Q493264) (← links)
- An adaptive augmented Lagrangian method for large-scale constrained optimization (Q494324) (← links)
- Open problems in nonlinear conjugate gradient algorithms for unconstrained optimization (Q538032) (← links)
- Solving the dual subproblem of the method of moving asymptotes using a trust-region scheme (Q545939) (← links)
- Convergence analysis of sparse quasi-Newton updates with positive definite matrix completion for two-dimensional functions (Q550506) (← links)
- CONDOR, a new parallel, constrained extension of Powell's UOBYQA algorithm: Experimental results and comparison with the DFO algorithm (Q557727) (← links)
- Updating the multipliers associated with inequality constraints in an augmented Lagrangian multiplier method (Q597168) (← links)
- Closed-loop reservoir management on the Brugge test case (Q601243) (← links)
- DrAmpl: A meta solver for optimization problem analysis (Q601972) (← links)
- Approximating Hessians in unconstrained optimization arising from discretized problems (Q645548) (← links)
- Numerical lower bound shakedown analysis of engineering structures (Q660272) (← links)
- Erratum to: ``Nonlinear programming without a penalty function or a filter'' (Q662297) (← links)
- Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points (Q683332) (← links)
- Global and local convergence of a class of penalty-free-type methods for nonlinear programming (Q693410) (← links)
- On a one-dimensional optimization problem derived from the efficiency analysis of Newton-PCG-like algorithms (Q697541) (← links)
- An efficient method for nonlinearly constrained networks (Q706946) (← links)
- Extended duality for nonlinear programming (Q707770) (← links)
- TACO: a toolkit for AMPL control optimization (Q744209) (← links)
- Augmented Lagrangian methods for nonlinear programming with possible infeasibility (Q746818) (← links)
- Optimality conditions in variational form for non-linear constrained stochastic control problems (Q827552) (← links)
- A heuristic for optimizing stochastic activity networks with applications to statistical digital circuit sizing (Q833427) (← links)
- Optimizing the composition profile of a functionally graded interlayer using a direct transcription method (Q835453) (← links)
- An optimal algorithm for bound and equality constrained quadratic programming problems with bounded spectrum (Q858185) (← links)
- Partitioning group correction Cholesky techniques for large scale sparse unconstrained optimization (Q858748) (← links)
- A \(p\)-version finite element method for nonlinear elliptic variational inequalities in 2D (Q861656) (← links)
- Monotone projected gradient methods for large-scale box-constrained quadratic programming (Q862715) (← links)
- A theoretical analysis of the cross-nested logit model (Q867562) (← links)
- A modified nearly exact method for solving low-rank trust region subproblem (Q868456) (← links)
- A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization (Q870176) (← links)
- A theoretical analysis on efficiency of some Newton-PCG methods (Q882949) (← links)
- Sparse quasi-Newton updates with positive definite matrix completion (Q930341) (← links)
- Conjugate gradient algorithms in nonconvex optimization (Q947710) (← links)
- Optimal quadratic programming algorithms. With applications to variational inequalities (Q960535) (← links)
- Proximal methods for nonlinear programming: Double regularization and inexact subproblems (Q975360) (← links)
- An active set quasi-Newton method with projected search for bound constrained minimization (Q980100) (← links)
- An algorithm for the fast solution of symmetric linear complementarity problems (Q998634) (← links)