Test example for nonlinear programming codes
From MaRDI portal
Publication:1252157
DOI10.1007/BF00934594zbMath0393.90072OpenAlexW4252626574MaRDI QIDQ1252157
Klaus Schittkowski, Willi Hock
Publication date: 1980
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00934594
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)
Related Items
A trust region method with project step for bound constrained optimization without compact condition, A method combining genetic algorithm with simultaneous perturbation stochastic approximation for linearly constrained stochastic optimization problems, Induction heating processes optimization: A general optimal control approach, A new framework for the computation of Hessians, An inexact first-order method for constrained nonlinear optimization, Experimentation in optimization, An efficient feasible SQP algorithm for inequality constrained optimization, A superlinearly convergent hybrid algorithm for solving nonlinear programming, Two differential equation systems for equality-constrained optimization, An inexact projected LM type algorithm for solving convex constrained nonlinear equations, A successive quadratic programming method that uses new corrections for search directions, An adaptive nonmonotone line search technique for solving systems of nonlinear equations, A superlinearly convergent numerical algorithm for nonlinear programming, Coupling genetic algorithm with a grid search method to solve mixed integer nonlinear programming problems, A new penalty-free-type algorithm based on trust region techniques, Finitely convergent \(\varepsilon\)-generalized projection algorithm for nonlinear systems, Optimality conditions for nonlinear semidefinite programming via squared slack variables, \textit{Helios}: A modeling language for global optimization and its implementation in \textit{Newton}, ALADIN‐—An open‐source MATLAB toolbox for distributed non‐convex optimization, A Mehrotra-type second-order predictor–corrector algorithm for nonlinear complementarity problems over symmetric cones, A Newton-Type Globally Convergent Interior-Point Method To Solve Multi-Objective Optimization Problems, An improved nonmonotone filter trust region method for equality constrained optimization, Sequential systems of linear equations algorithm for nonlinear optimization problems -- general constrained problems., An improved interior-type feasible QP-free algorithm for inequality constrained optimization problems, A noninterior path following algorithm for solving a class of multiobjective programming problems, A derivative-free trust region algorithm with nonmonotone filter technique for bound constrained optimization, A hybrid epigraph directions method for nonsmooth and nonconvex constrained optimization via generalized augmented Lagrangian duality and a genetic algorithm, Extension of modified Polak-Ribière-Polyak conjugate gradient method to linear equality constraints minimization problems, A fractional trust region method for linear equality constrained optimization, A quasi-Newton modified LP-Newton method, Inexact Sequential Quadratic Optimization with Penalty Parameter Updates within the QP Solver, A new infeasible Mehrotra-type predictor-corrector algorithm for nonlinear complementarity problems over symmetric cones, DEFT-FUNNEL: an open-source global optimization solver for constrained grey-box and black-box problems, A nonmonotone filter trust region method for nonlinear constrained optimization, A Nonmonotone Matrix-Free Algorithm for Nonlinear Equality-Constrained Least-Squares Problems, Global optimization test problems based on random field composition, A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences, An improved sequential quadratic programming algorithm for solving general nonlinear programming problems, A reduced Hessian algorithm with line search filter method for nonlinear programming, A dynamic convexized method for nonconvex mixed integer nonlinear programming, A hybrid method combining continuous tabu search and Nelder--Mead simplex algorithms for the global optimization of multiminima functions, A critical review of discrete filled function methods in solving nonlinear discrete optimization problems, A feasible QP-free algorithm combining the interior-point method with active set for constrained optimization, Mathematical programming models and algorithms for engineering design optimization, An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs, Nonlinear programming on a microcomputer, A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization, Higher-order reverse automatic differentiation with emphasis on the third-order, A new finitely convergent algorithm for systems of nonlinear inequalities, A QP-free algorithm of quasi-strongly sub-feasible directions for inequality constrained optimization, A trust-region SQP method without a penalty or a filter for nonlinear programming, A Framework for Simulating and Estimating the State and Functional Topology of Complex Dynamic Geometric Networks, A kind of QP-free feasible method, Some experiments on heuristic code selection versus numerical performance in nonlinear programming, Extended ant colony optimization for non-convex mixed integer nonlinear programming, A globally convergent primal-dual interior-point relaxation method for nonlinear programs, Numerical experience with a derivative-free trust-funnel method for nonlinear optimization problems with general nonlinear constraints, Optimality Conditions for Problems over Symmetric Cones and a Simple Augmented Lagrangian Method, A gentle introduction to Numerica, A conic trust-region method and its convergence properties, Computing the sparsity pattern of Hessians using automatic differentiation, Advances in trust region algorithms for constrained optimization, An approximate approach of global optimization for polynomial programming problems, A globally and superlinearly convergent feasible QP-free method for nonlinear programming, A general method for solving constrained optimization problems, A continuously differentiable exact penalty function for nonlinear programming problems with unbounded feasible set, Application of sequential quadratic programming software program to an actual problem, Analysis and implementation of a dual algorithm for constrained optimization, A central path interior point method for nonlinear programming and its local convergence, An active set RQP algorithm for engineering design optimization
Cites Work
- A class of quadratically convergent algorithms for constrained function minimization
- An accelerated multiplier method for nonlinear programming
- Sequential gradient-restoration algorithm for the minimization of constrained functions. Ordinary and conjugate gradient versions
- Use of the augmented penalty function in mathematical programming problems. I: Ordinary gradient algorithm
- A set of geometric programming test problems and their solutions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
