The following pages link to LANCELOT (Q13256):
Displaying 50 items.
- Local analysis of a new multipliers method (Q1848393) (← links)
- Interior-point methods for nonconvex nonlinear programming: Filter methods and merit functions (Q1856370) (← links)
- A limited-memory multipoint symmetric secant method for bound constrained optimization (Q1861917) (← links)
- An affine scaling trust-region approach to bound-constrained nonlinear systems (Q1861959) (← links)
- Structured low rank approximation (Q1874666) (← links)
- An algorithm for nonlinear optimization using linear programming and equality constrained subproblems (Q1890303) (← links)
- A trust-region strategy for minimization on arbitrary domains (Q1890927) (← links)
- Using the KKT matrix in an augmented Lagrangian SQP method for sparse constrained optimization (Q1893348) (← links)
- Numerical solution of dynamic optimization problems using parametrization and \(\text{Op}^{\text{ti}}\text{A}\) software (Q1923346) (← links)
- Evaluating bound-constrained minimization software (Q1928747) (← links)
- A hybrid differential dynamic programming algorithm for constrained optimal control problems. I: Theory (Q1937080) (← links)
- A trust region affine scaling method for bound constrained optimization (Q1942658) (← links)
- Shape optimization under width constraint (Q1943659) (← links)
- Reverse bridge theorem under constraint partition (Q1958870) (← links)
- Inexact-restoration algorithm for constrained optimization (Q1973486) (← links)
- A basis reduction method using proper orthogonal decomposition for shakedown analysis of kinematic hardening material (Q1999549) (← links)
- Simple algorithms for optimization on Riemannian manifolds with constraints (Q2019906) (← links)
- High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms (Q2020600) (← links)
- An accelerated augmented Lagrangian algorithm with adaptive orthogonalization strategy for bound and equality constrained quadratic programming and its application to large-scale contact problems of elasticity (Q2029432) (← links)
- Unified convergence analysis of a second-order method of multipliers for nonlinear conic programming (Q2090426) (← links)
- A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs (Q2105288) (← links)
- A primal-dual algorithm for risk minimization (Q2133418) (← links)
- An augmented Lagrangian method exploiting an active-set strategy and second-order information (Q2139257) (← links)
- LMBOPT: a limited memory method for bound-constrained optimization (Q2146448) (← links)
- A note on solving nonlinear optimization problems in variable precision (Q2191797) (← links)
- On multi-modal fusion learning in constraint propagation (Q2198242) (← links)
- Development of an adaptive infill criterion for constrained multi-objective asynchronous surrogate-based optimization (Q2200087) (← links)
- An augmented Lagrangian filter method (Q2216190) (← links)
- Transistor sizing of custom high-performance digital circuits with parametric yield considerations (Q2254194) (← links)
- Complementarity-based nonlinear programming techniques for optimal mixing in gas networks (Q2294075) (← links)
- A software framework for embedded nonlinear model predictive control using a gradient-based augmented Lagrangian approach (GRAMPC) (Q2331376) (← links)
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization (Q2352415) (← links)
- A matrix-free augmented Lagrangian algorithm with application to large-scale structural design optimization (Q2358024) (← links)
- A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization (Q2363570) (← links)
- Superlinearly convergent trust-region method without the assumption of positive-definite Hessian (Q2370038) (← links)
- Sequential equality-constrained optimization for nonlinear programming (Q2374366) (← links)
- An inexact restoration strategy for the globalization of the sSQP method (Q2377163) (← links)
- Dealing with singularities in nonlinear unconstrained optimization (Q2378447) (← links)
- Truncated partitioning group correction algorithms for large-scale sparse unconstrained optimi\-zation (Q2383749) (← links)
- The heat equation as grid smoothing in a local optimization procedure (Q2384511) (← links)
- Application of lower bound direct method to engineering structures (Q2385504) (← links)
- Numerical research on the sensitivity of nonmonotone trust region algorithms to their parameters (Q2389479) (← links)
- Constrained derivative-free optimization on thin domains (Q2392122) (← links)
- An adaptive truncation criterion, for linesearch-based truncated Newton methods in large scale nonconvex optimization (Q2417038) (← links)
- PAL-Hom method for QP and an application to LP (Q2419548) (← links)
- An augmented Lagrangian method for equality constrained optimization with rapid infeasibility detection capabilities (Q2420776) (← links)
- Progress in shakedown analysis with applications to composites (Q2432414) (← links)
- Analysis on a superlinearly convergent augmented Lagrangian method (Q2440487) (← links)
- How to ``alternatize'' a clustering algorithm (Q2441818) (← links)
- A multiplier active-set trust-region algorithm for solving constrained optimization problem (Q2449200) (← links)
