LANCELOT

swMATH500MaRDI QIDQ13256FDOQ13256

Author name not available (Why is that?)

Described by source

• Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization
• Unnamed Publication
• Unnamed Publication

Cited In (only showing first 100 items - show all)

• A trust region algorithm of a new conic model for nonlinearly equality constrained optimization
• Proximal methods for nonlinear programming: Double regularization and inexact subproblems
• Stabilized optimization via an NCL algorithm
• Impact of partial separability on large-scale optimization
• On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians
• Interactions between nonlinear programming and modeling systems
• Title not available (Why is that?)
• A multiplier active-set trust-region algorithm for solving constrained optimization problem
• Improved sequential linear programming formulation for structural weight minimization
• Conjugate gradient algorithms in nonconvex optimization
• An interior-point algorithm for nonconvex nonlinear programming
• An active-set trust-region method for derivative-free nonlinear bound-constrained optimization
• A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization
• A survey of truncated-Newton methods
• Solving the dual subproblem of the method of moving asymptotes using a trust-region scheme
• An algorithm for nonlinear optimization using linear programming and equality constrained subproblems
• Spectral gradient methods for linearly constrained optimization
• A Global Convergence Analysis of an Algorithm for Large-Scale Nonlinear Optimization Problems
• A hybrid of adjustable trust-region and nonmonotone algorithms for unconstrained optimization
• Interior-point methods for nonconvex nonlinear programming: Filter methods and merit functions
• A hybrid differential dynamic programming algorithm for constrained optimal control problems. I: Theory
• A direct differentiation formulation of electromechanical sensitivity analysis for rough surfaces in contact
• Numerical comparison of merit function with filter criterion in inexact restoration algorithms using hard-spheres problems
• An active set quasi-Newton method with projected search for bound constrained minimization
• On the dual formulation of regularized linear systems with convex risks
• Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
• Closed-loop reservoir management on the Brugge test case
• Numerical lower bound shakedown analysis of engineering structures
• Degenerate Nonlinear Programming with a Quadratic Growth Condition
• On diagonally structured problems in unconstrained optimization using an inexact super Halley method
• A new SQP algorithm for large-scale nonlinear programming
• Nonlinear optimization with GAMS /LGO
• SQP methods for large-scale nonlinear programming
• Augmented Lagrangian methods for nonlinear programming with possible infeasibility
• Simple algorithms for optimization on Riemannian manifolds with constraints
• Incomplete Cholesky Factorizations with Limited Memory
• Partitioning group correction Cholesky techniques for large scale sparse unconstrained optimization
• Convergence Properties of Minimization Algorithms for Convex Constraints Using a Structured Trust Region
• The substitution secant/finite difference method for large scale sparse unconstrained optimization
• Title not available (Why is that?)
• A Globally Convergent Linearly Constrained Lagrangian Method for Nonlinear Optimization
• Complementarity-based nonlinear programming techniques for optimal mixing in gas networks
• Local convergence of exact and inexact augmented Lagrangian methods under the second-order sufficient optimality condition
• A Trust-Region Approach to Nonlinear Systems of Equalities and Inequalities
• An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints
• Modifying the inertia of matrices arising in optimization
• Optimal Dimensioning of Pipe Networks with Application to Gas Transmission Networks
• Approximating Hessians in unconstrained optimization arising from discretized problems
• Computational approaches to parameter estimation and model selection in immunology
• Title not available (Why is that?)
• An optimal algorithm for bound and equality constrained quadratic programming problems with bounded spectrum
• A \(p\)-version finite element method for nonlinear elliptic variational inequalities in 2D
• An interior-point penalty active-set trust-region algorithm
• An Optimal Positive Definite Update for Sparse Hessian Matrices
• Optimal quadratic programming algorithms. With applications to variational inequalities
• Solution of a general linear complementarity problem using smooth optimization and its application to bilinear programming and LCP
• Optical tomography as a PDE-constrained optimization problem
• Optimizing partially separable functions without derivatives
• On the multiplier-penalty-approach for quasi-variational inequalities
• Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization
• Application of lower bound direct method to engineering structures
• Truncated partitioning group correction algorithms for large-scale sparse unconstrained optimi\-zation
• Progress in shakedown analysis with applications to composites
• Erratum to: ``Nonlinear programming without a penalty function or a filter
• Numerical experience with a recursive trust-region method for multilevel nonlinear bound-constrained optimization
• On a one-dimensional optimization problem derived from the efficiency analysis of Newton-PCG-like algorithms
• Convergence analysis of sparse quasi-Newton updates with positive definite matrix completion for two-dimensional functions
• Primal-dual active-set methods for large-scale optimization
• An adaptive augmented Lagrangian method for large-scale constrained optimization
• Application of shakedown analysis to the plastic design of composites
• A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds
• Title not available (Why is that?)
• Title not available (Why is that?)
• A new trust region algorithm for bound constrained minimization
• An algorithm for the fast solution of symmetric linear complementarity problems
• A matrix-free augmented Lagrangian algorithm with application to large-scale structural design optimization
• Sparse quasi-Newton updates with positive definite matrix completion
• Validation of an augmented Lagrangian algorithm with a Gauss-Newton Hessian approximation using a set of hard-spheres problems
• Computing Gradients in Large-Scale Optimization Using Automatic Differentiation
• Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints
• Nonmonotone strategy for minimization of quadratics with simple constraints.
• A practical relative error criterion for augmented Lagrangians
• Monotone projected gradient methods for large-scale box-constrained quadratic programming
• Inexact Semimonotonic Augmented Lagrangians with Optimal Feasibility Convergence for Convex Bound and Equality Constrained Quadratic Programming
• Constrained derivative-free optimization on thin domains
• Distributed optimal control of nonlinear systems using a second-order augmented Lagrangian method
• Extremal problems for convex polygons
• Title not available (Why is that?)
• Convergence results of an augmented Lagrangian method using the exponential penalty function
• A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization
• SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
• CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
• On an inexact trust-region SQP-filter method for constrained nonlinear optimization
• A globally convergent penalty-free method for optimization with equality constraints and simple bounds
• Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
• Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• A software framework for embedded nonlinear model predictive control using a gradient-based augmented Lagrangian approach (GRAMPC)
• On Modified Factorizations for Large-Scale Linearly Constrained Optimization
• Numerical methods for large-scale nonlinear optimization

This page was built for software: LANCELOT