More test examples for nonlinear programming codes
From MaRDI portal
Publication:1111932
zbMath0658.90060MaRDI QIDQ1111932
Publication date: 1987
Published in: Lecture Notes in Economics and Mathematical Systems (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (only showing first 100 items - show all)
A trust region method with project step for bound constrained optimization without compact condition ⋮ A derivative-free affine scaling trust region methods based on probabilistic models with new nonmonotone line search technique for linear inequality constrained minimization without strict complementarity ⋮ Simultaneous iterative solutions for the trust-region and minimum eigenvalue subproblem ⋮ A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization ⋮ An approach to multi-start clustering for global optimization with non-linear constraints ⋮ État de l'art des méthodes “d'optimisation globale” ⋮ A superlinearly convergent hybrid algorithm for solving nonlinear programming ⋮ FITTING OF TABU SEARCH TO OPTIMIZE FUNCTIONS OF CONTINUOUS VARIABLES ⋮ Global convergence of a new nonmonotone filter method for equality constrained optimization ⋮ A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization ⋮ A theoretical and empirical comparison of gradient approximations in derivative-free optimization ⋮ Inverse analysis method using MPP-based dimension reduction for reliability-based design optimization of nonlinear and multi-dimensional systems ⋮ Two differential equation systems for equality-constrained optimization ⋮ A new QPSO based hybrid algorithm for constrained optimization problems via tournamenting process ⋮ Global convergence and the Powell singular function ⋮ A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization ⋮ Computing shadow prices with multiple Lagrange multipliers ⋮ A mixed finite differences scheme for gradient approximation ⋮ Unnamed Item ⋮ A trust region method for noisy unconstrained optimization ⋮ A novel projected gradient-like method for optimization problems with simple constraints ⋮ Local search enhanced aquila optimization algorithm ameliorated with an ensemble of wavelet mutation strategies for complex optimization problems ⋮ A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization ⋮ A self-organizing migrating genetic algorithm for constrained optimization ⋮ A derivative-free modified tensor method with curvilinear linesearch for unconstrained nonlinear programming ⋮ A nonmonotone line search filter method with reduced Hessian updating for nonlinear optimization ⋮ General primal-dual penalty/barrier path-following Newton methods for nonlinear programming ⋮ Determination of satisfying and efficient solutions in convex multi-objective programming ⋮ A sharp augmented Lagrangian-based method in constrained non-convex optimization ⋮ Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods ⋮ A new class of test functions for global optimization ⋮ An affine scaling interior algorithm via Lanczos path for solving bound-constrained nonlinear systems ⋮ A Nonmonotone Matrix-Free Algorithm for Nonlinear Equality-Constrained Least-Squares Problems ⋮ Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems ⋮ A Mixed and Superlinearly Convergent Algorithm for Constrained Optimization ⋮ Globally convergent inexact generalized Newton method for first-order differentiable optimization problems ⋮ Finding discrete global minima with a filled function for integer programming ⋮ A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences ⋮ An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity ⋮ Stable factorized quasi-Newton methods for nonlinear least-squares problems ⋮ Discrete filled function method for discrete global optimization ⋮ A new filled function method for nonlinear integer programming problem ⋮ A penalty-free-type nonmonotone trust-region method for nonlinear constrained optimization ⋮ On memory gradient method with trust region for unconstrained optimization ⋮ A general class of penalty/barrier path-following Newton methods for nonlinear programming ⋮ A sequential cutting plane algorithm for solving convex NLP problems ⋮ A family of improved secant methods via nonmonotone curvilinear paths technique for equality constrained optimization ⋮ A trust-region and affine scaling algorithm for linearly constrained optimization ⋮ A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization ⋮ A nonmonotone SQP-filter method for equality constrained optimization ⋮ Solving unconstrained optimization problem with a filter-based nonmonotone pattern search algorithm ⋮ A robust SQP method based on a smoothing lower order penalty function† ⋮ Generalized monotone line search SQP algorithm for constrained minimax problems ⋮ A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints ⋮ Dimension Reduction Method-Based RBDO for Dependent Interval Variables ⋮ A Collection of Test Multiextremal Optimal Control Problems ⋮ Efficient hybrid methods for global continuous optimization based on simulated annealing ⋮ A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization ⋮ COCO: a platform for comparing continuous optimizers in a black-box setting ⋮ A variant of curved search method ⋮ An affine scaling interior trust-region method combining with nonmonotone line search filter technique for linear inequality constrained minimization ⋮ Some Quadrature-Based Versions of the Generalized Newton Method for Solving Unconstrained Optimization Problems ⋮ A trust-region algorithm for equality-constrained optimization via a reduced dimension approach. ⋮ A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity ⋮ A class of derivative-free trust-region methods with interior backtracking technique for nonlinear optimization problems subject to linear inequality constraints ⋮ A dwindling filter trust region algorithm for nonlinear optimization ⋮ A class of nonmonotone stabilization trust region methods ⋮ Norm-relaxed method of feasible directions for solving nonlinear programming problems ⋮ A trust-region algorithm combining line search filter method with Lagrange merit function for nonlinear constrained optimization ⋮ Constrained optimization involving expensive function evaluations: A sequential approach ⋮ A two-piece update of projected Hessian algorithm with nonmonotonic trust region method for constrained optimization ⋮ On the global convergence of a projective trust region algorithm for nonlinear equality constrained optimization ⋮ An ODE-based approach to nonlinearly constrained minimax problems ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ Nonmonotone trust-region method for nonlinear programming with general constraints and simple bounds ⋮ A multiobjective evolutionary algorithm for approximating the efficient set ⋮ A modified quasi-Newton method for structured optimization with partial information on the Hessian ⋮ Test problem generator for unconstrained global optimization ⋮ Computing global minima to polynomial optimization problems using Gröbner bases ⋮ A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization ⋮ A new heuristic algorithm for probabilistic optimization ⋮ A strongly convergent norm-relaxed method of strongly sub-feasible direction for optimization with nonlinear equality and inequality constraints ⋮ How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results ⋮ Self-tuning norm-relaxed method of feasible directions ⋮ Nonmonotone Levenberg-Marquardt algorithms and their convergence analysis ⋮ A quasi-Newton based pattern search algorithm for unconstrained optimization ⋮ Integral global minimization: Algorithms, implementations and numerical tests ⋮ Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints ⋮ Augmented penalty algorithms based on BFGS secant approximations and trust regions ⋮ Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization ⋮ Use of the minimum norm search direction in a nonmonotone version of the Gauss-Newton method ⋮ On the formulation and theory of the Newton interior-point method for nonlinear programming ⋮ A new discrete filled function algorithm for discrete global optimization ⋮ Discrete global descent method for discrete global optimization and nonlinear integer programming ⋮ CARTopt: a random search method for nonsmooth unconstrained optimization ⋮ Manifold relaxations for integer programming ⋮ Improvements to single-objective constrained predator-prey evolutionary optimization algorithm ⋮ PyOpt: a python-based object-oriented framework for nonlinear constrained optimization ⋮ Finitely convergent \(\varepsilon\)-generalized projection algorithm for nonlinear systems ⋮ Derivative-free methods for bound constrained mixed-integer optimization
This page was built for publication: More test examples for nonlinear programming codes
