LANCELOT
From MaRDI portal
Software:13256
No author found.
Related Items (only showing first 100 items - show all)
A globally convergent penalty-free method for optimization with equality constraints and simple bounds ⋮ Optimality conditions in variational form for non-linear constrained stochastic control problems ⋮ On the application of an augmented Lagrangian algorithm to some portfolio problems ⋮ A new trust region algorithm for bound constrained minimization ⋮ A heuristic for optimizing stochastic activity networks with applications to statistical digital circuit sizing ⋮ Corrected sequential linear programming for sparse minimax optimization ⋮ Stabilized optimization via an NCL algorithm ⋮ Optimizing the composition profile of a functionally graded interlayer using a direct transcription method ⋮ A note on exploiting structure when using slack variables ⋮ A hybrid of adjustable trust-region and nonmonotone algorithms for unconstrained optimization ⋮ Computational comparison of surface metrics for PDE constrained shape optimization ⋮ OPTIMASS: a package for the minimization of kinematic mass functions with constraints ⋮ A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms ⋮ Best practices for comparing optimization algorithms ⋮ An interior-point penalty active-set trust-region algorithm ⋮ A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm ⋮ An optimal algorithm for bound and equality constrained quadratic programming problems with bounded spectrum ⋮ Partitioning group correction Cholesky techniques for large scale sparse unconstrained optimization ⋮ Impact of partial separability on large-scale optimization ⋮ On the number of inner iterations per outer iteration of a globally convergent algorithm for optimization with general nonlinear inequality constraints and simple bounds ⋮ Numerical experiences with new truncated Newton methods in large scale unconstrained optimization ⋮ Sequential quadratic programming methods for large-scale problems ⋮ Interactions between nonlinear programming and modeling systems ⋮ Recent progress in unconstrained nonlinear optimization without derivatives ⋮ A \(p\)-version finite element method for nonlinear elliptic variational inequalities in 2D ⋮ On the multiplier-penalty-approach for quasi-variational inequalities ⋮ Monotone projected gradient methods for large-scale box-constrained quadratic programming ⋮ A theoretical analysis of the cross-nested logit model ⋮ A modified nearly exact method for solving low-rank trust region subproblem ⋮ A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization ⋮ Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints ⋮ Updating the multipliers associated with inequality constraints in an augmented Lagrangian multiplier method ⋮ Closed-loop reservoir management on the Brugge test case ⋮ DrAmpl: A meta solver for optimization problem analysis ⋮ A practical relative error criterion for augmented Lagrangians ⋮ A theoretical analysis on efficiency of some Newton-PCG methods ⋮ On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians ⋮ An SR1/BFGS SQP algorithm for nonconvex nonlinear programs with block-diagonal Hessian matrix ⋮ A direct differentiation formulation of electromechanical sensitivity analysis for rough surfaces in contact ⋮ Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization ⋮ On diagonally structured problems in unconstrained optimization using an inexact super Halley method ⋮ Non-monotone trust region methods for nonlinear equality constrained optimization without a penalty function ⋮ A primal-dual augmented Lagrangian ⋮ Approximating Hessians in unconstrained optimization arising from discretized problems ⋮ Mathematical reliability: an expository perspective. ⋮ An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints ⋮ The flattened aggregate constraint homotopy method for nonlinear programming problems with many nonlinear constraints ⋮ Sparse quasi-Newton updates with positive definite matrix completion ⋮ Numerical lower bound shakedown analysis of engineering structures ⋮ Erratum to: ``Nonlinear programming without a penalty function or a filter ⋮ Primal-dual active-set methods for large-scale optimization ⋮ An adaptive augmented Lagrangian method for large-scale constrained optimization ⋮ Conjugate gradient algorithms in nonconvex optimization ⋮ Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points ⋮ Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm ⋮ Optimal quadratic programming algorithms. With applications to variational inequalities ⋮ Global and local convergence of a class of penalty-free-type methods for nonlinear programming ⋮ Open problems in nonlinear conjugate gradient algorithms for unconstrained optimization ⋮ On a one-dimensional optimization problem derived from the efficiency analysis of Newton-PCG-like algorithms ⋮ Solving the dual subproblem of the method of moving asymptotes using a trust-region scheme ⋮ Convergence analysis of sparse quasi-Newton updates with positive definite matrix completion for two-dimensional functions ⋮ A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization ⋮ Proximal methods for nonlinear programming: Double regularization and inexact subproblems ⋮ Augmented Lagrangian algorithms based on the spectral projected gradient method for solving nonlinear programming problems ⋮ An efficient method for nonlinearly constrained networks ⋮ Extended duality for nonlinear programming ⋮ CONDOR, a new parallel, constrained extension of Powell's UOBYQA algorithm: Experimental results and comparison with the DFO algorithm ⋮ Nonmonotone strategy for minimization of quadratics with simple constraints. ⋮ An active set quasi-Newton method with projected search for bound constrained minimization ⋮ A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs ⋮ An inexact Newton method derived from efficiency analysis ⋮ A new augmented Lagrangian method for equality constrained optimization with simple unconstrained subproblem ⋮ An algorithm for the fast solution of symmetric linear complementarity problems ⋮ Quasi-Newton acceleration for equality-constrained minimization ⋮ TACO: a toolkit for AMPL control optimization ⋮ A decomposition approach for the fuel-constrained economic power-dispatch problem ⋮ Recognizing underlying sparsity in optimization ⋮ Augmented Lagrangian methods for nonlinear programming with possible infeasibility ⋮ A truncated Newton method for the solution of large-scale inequality constrained minimization problems ⋮ Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results ⋮ A penalty-function-free line search SQP method for nonlinear programming ⋮ Nonmonotone curvilinear line search methods for unconstrained optimization ⋮ Application of shakedown analysis to the plastic design of composites ⋮ Elastic plastic shakedown of 3D periodic heterogeneous media: a direct numerical approach ⋮ Nonlinear programming algorithms using trust regions and augmented Lagrangians with nonmonotone penalty parameters. ⋮ On proving existence of feasible points in equality constrained optimization problems ⋮ Solving elliptic control problems with interior point and SQP methods: Control and state constraints ⋮ Theoretical efficiency of an inexact Newton method ⋮ A shifted-barrier primal-dual algorithm model for linearly constrained optimization problems ⋮ An interior-point algorithm for nonconvex nonlinear programming ⋮ Global convergence of QPFTH method for large-scale nonlinear sparse constrained optimization ⋮ Validation of an augmented Lagrangian algorithm with a Gauss-Newton Hessian approximation using a set of hard-spheres problems ⋮ Modifying the inertia of matrices arising in optimization ⋮ A survey of truncated-Newton methods ⋮ Modifications to the subroutine OPALQP for dealing with large problems ⋮ A projected conjugate gradient method for sparse minimax problems ⋮ Convergence results of an augmented Lagrangian method using the exponential penalty function ⋮ On the behavior of the gradient norm in the steepest descent method ⋮ On the rate of convergence of sequential quadratic programming with nondifferentiable exact penalty function in the presence of constraint degeneracy ⋮ On an inexact trust-region SQP-filter method for constrained nonlinear optimization
This page was built for software: LANCELOT
