More test examples for nonlinear programming codes
From MaRDI portal
A detailed description of 188 problems for testing nonlinear programming algorithms is presented. The considered types of objective functions are: linear (33 problems), quadratic (44), sum of squares (36), generalized polynomial (57), general (23). Among them 46 problems are unconstrained, 24 problems are with linear constraint functions, 54 with quadratic, 18 with generalized polynomials and 12 with general constraint functions. For 9 problems upper and lower bounds are presented.
Recommendations
Cited in
(only showing first 100 items - show all)- A new finitely convergent algorithm for systems of nonlinear inequalities
- A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization
- Solving constrained optimization problems using a novel genetic algorithm
- An affine scaling optimal path method with interior backtracking curvilinear technique for linear constrained optimization
- An XML-based schema for stochastic programs
- Nonmonotonic reduced projected Hessian method via an affine scaling interior modified gradient path for bounded-constrained optimization
- Pattern search ranking and selection algorithms for mixed variable simulation-based optimization
- Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions
- A linear programming-based optimization algorithm for solving nonlinear programming problems
- An analytical approach to global optimization
- A collection of test problems for constrained global optimization algorithms
- Modified partial-update Newton-type algorithms for unary optimization
- Global convergence analysis of algorithms for finding feasible points in norm-relaxed MFD
- An SQP method for general nonlinear programs using only equality constrained subproblems
- A generalization of the norm-relaxed method of feasible directions
- An approximate approach of global optimization for polynomial programming problems
- A new technique for inconsistent QP problems in the SQP method
- Handbook of test problems in local and global optimization
- Scaled optimal path trust-region algorithm
- Exploiting additional structure in equality constrained optimization by structured SQP secant algorithms
- A class of nonmonotone stabilization trust region methods
- Norm-relaxed method of feasible directions for solving nonlinear programming problems
- A new heuristic algorithm for probabilistic optimization
- Self-tuning norm-relaxed method of feasible directions
- Nonmonotone Levenberg-Marquardt algorithms and their convergence analysis
- Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints
- A new approach to stochastic programming problems: Discrete model
- Performance of several nonlinear programming software packages on microcomputers.
- Sequential systems of linear equations algorithm for nonlinear optimization problems -- general constrained problems.
- Test problem generator by neural network for algorithms that try solving nonlinear programming problems globally
- Reformulating the traffic equilibrium problem via a smooth gap function.
- On the global convergence of a projective trust region algorithm for nonlinear equality constrained optimization
- How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results
- A derivative-free trust region algorithm with nonmonotone filter technique for bound constrained optimization
- Fuzzy costs in quadratic programming problems
- Some experiments on heuristic code selection versus numerical performance in nonlinear programming
- Nonmonotonic back-tracking trust region interior point algorithm for linear constrained optimization
- Numerical comparisons of path-following strategies for a primal-dual interior-point method for nonlinear programming
- Adaptive algorithm for constrained least-squares problems
- A trust-region algorithm for equality-constrained optimization via a reduced dimension approach.
- 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
- An ODE-based approach to nonlinearly constrained minimax problems
- Computing global minima to polynomial optimization problems using Gröbner bases
- Integral global minimization: Algorithms, implementations and numerical tests
- Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization
- On the formulation and theory of the Newton interior-point method for nonlinear programming
- Obtaining test problems via Internet
- Derivative-free methods for bound constrained mixed-integer optimization
- Benchmarking nonlinear optimization software in technical computing environments
- An improved nonmonotone filter trust region method for equality constrained optimization
- A perturbed version of an inexact generalized Newton method for solving nonsmooth equations
- A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints
- A theoretical and empirical comparison of gradient approximations in derivative-free optimization
- A new QPSO based hybrid algorithm for constrained optimization problems via tournamenting process
- A novel projected gradient-like method for optimization problems with simple constraints
- Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems
- A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences
- A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization
- 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
- Two differential equation systems for equality-constrained optimization
- Global convergence and the Powell singular function
- A self-organizing migrating genetic algorithm for constrained optimization
- A nonmonotone line search filter method with reduced Hessian updating for nonlinear optimization
- A new class of test functions for global optimization
- An affine scaling interior algorithm via Lanczos path for solving bound-constrained nonlinear systems
- Finding discrete global minima with a filled function for integer programming
- An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity
- 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 sequential cutting plane algorithm for solving convex NLP problems
- 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
- Solving unconstrained optimization problem with a filter-based nonmonotone pattern search algorithm
- 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
- A superlinearly convergent hybrid algorithm for solving nonlinear programming
- Inverse analysis method using MPP-based dimension reduction for reliability-based design optimization of nonlinear and multi-dimensional systems
- Computing shadow prices with multiple Lagrange multipliers
- A mixed finite differences scheme for gradient approximation
- A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity
- A dwindling filter trust region algorithm for nonlinear optimization
- A trust-region algorithm combining line search filter method with Lagrange merit function for nonlinear constrained optimization
- A nonmonotone SQP-filter method for equality constrained optimization
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- scientific article; zbMATH DE number 3848983 (Why is no real title available?)
- Test problem generator for unconstrained global optimization
- scientific article; zbMATH DE number 4139203 (Why is no real title available?)
- A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization
- General primal-dual penalty/barrier path-following Newton methods for nonlinear programming
- A robust SQP method based on a smoothing lower order penalty function†
- Generalized monotone line search SQP algorithm for constrained minimax problems
- 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
- scientific article; zbMATH DE number 4110458 (Why is no real title available?)
This page was built for publication: More test examples for nonlinear programming codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1111932)
