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)

• Enriched methods for large-scale unconstrained optimization
• A theoretical analysis of the cross-nested logit model
• A truncated Newton method for the solution of large-scale inequality constrained minimization problems
• Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points
• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimality conditions in variational form for non-linear constrained stochastic control problems
• A heuristic for optimizing stochastic activity networks with applications to statistical digital circuit sizing
• Finite elements for geometrical minimal shape
• A decomposition approach for the fuel-constrained economic power-dispatch problem
• An interface optimization and application for the numerical solution of optimal control problems
• A Class of Indefinite Dogleg Path Methods for Unconstrained Minimization
• Numerical analysis of leaving-face parameters in bound-constrained quadratic minimization
• Solving elliptic control problems with interior point and SQP methods: Control and state constraints
• Quasi-Newton acceleration for equality-constrained minimization
• Extended duality for nonlinear programming
• Unified convergence analysis of a second-order method of multipliers for nonlinear conic programming
• Modifications to the subroutine OPALQP for dealing with large problems
• Survey of trust-region derivative free optimization methods
• On the complete pivoting conjecture for a hadamard matrix of order 12
• An interior point method for nonlinear programming with infeasibility detection capabilities
• A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms
• A Practical Algorithm for General Large Scale Nonlinear Optimization Problems
• Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm
• Title not available (Why is that?)
• Theoretical efficiency of an inexact Newton method
• A trust-region strategy for minimization on arbitrary domains
• Using the KKT matrix in an augmented Lagrangian SQP method for sparse constrained optimization
• A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints
• Title not available (Why is that?)
• A modified nearly exact method for solving low-rank trust region subproblem
• Augmented Lagrangian algorithms based on the spectral projected gradient method for solving nonlinear programming problems
• Mathematical reliability: an expository perspective.
• Updating the multipliers associated with inequality constraints in an augmented Lagrangian multiplier method
• Numerical experiences with new truncated Newton methods in large scale unconstrained optimization
• A theoretical analysis on efficiency of some Newton-PCG methods
• Sequential equality-constrained optimization for nonlinear programming
• Analysis on a superlinearly convergent augmented Lagrangian method
• An affine scaling trust-region approach to bound-constrained nonlinear systems
• Solving Large-Scale Nonlinear Programming Problems by Constraint Partitioning
• Complexity and performance of an augmented Lagrangian algorithm
• A shifted-barrier primal-dual algorithm model for linearly constrained optimization problems
• Elastic plastic shakedown of 3D periodic heterogeneous media: a direct numerical approach
• Nonmonotone curvilinear line search methods for unconstrained optimization
• Local analysis of a new multipliers method
• LMBOPT: a limited memory method for bound-constrained optimization
• An SQP method with a revised non-monotone line search
• Title not available (Why is that?)
• An augmented Lagrangian method exploiting an active-set strategy and second-order information
• A linearly constrained optimization problem for planar grid generation
• A new approach to optimizing energy systems
• Title not available (Why is that?)
• A projected conjugate gradient method for sparse minimax problems
• Evaluating bound-constrained minimization software
• Title not available (Why is that?)
• A limited-memory multipoint symmetric secant method for bound constrained optimization
• Title not available (Why is that?)
• Superlinearly convergent trust-region method without the assumption of positive-definite Hessian
• Optimizing the composition profile of a functionally graded interlayer using a direct transcription method
• An Efficient Algorithm for Large-Scale Nonlinear Programming Problems with Simple Bounds on the Variables
• Optimal Signal Sets for Non-Gaussian Detectors
• An inexact Newton method derived from efficiency analysis
• Curvilinear Stabilization Techniques for Truncated Newton Methods in Large Scale Unconstrained Optimization
• Dealing with singularities in nonlinear unconstrained optimization
• Numerical research on the sensitivity of nonmonotone trust region algorithms to their parameters
• 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

This page was built for software: LANCELOT