Test example for nonlinear programming codes

Cites work

scientific article; zbMATH DE number 3711294 (Why is no real title available?)
scientific article; zbMATH DE number 3621497 (Why is no real title available?)
scientific article; zbMATH DE number 3435021 (Why is no real title available?)
scientific article; zbMATH DE number 3308855 (Why is no real title available?)
scientific article; zbMATH DE number 3356498 (Why is no real title available?)
scientific article; zbMATH DE number 3382096 (Why is no real title available?)
A class of quadratically convergent algorithms for constrained function minimization
A set of geometric programming test problems and their solutions
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

Cited in

(70)

Induction heating processes optimization: A general optimal control approach
A new framework for the computation of Hessians
A method combining genetic algorithm with simultaneous perturbation stochastic approximation for linearly constrained stochastic optimization problems
A new penalty-free-type algorithm based on trust region techniques
A framework for simulating and estimating the state and functional topology of complex dynamic geometric networks
A critical review of discrete filled function methods in solving nonlinear discrete optimization problems
DEFT-FUNNEL: an open-source global optimization solver for constrained grey-box and black-box problems
An improved sequential quadratic programming algorithm for solving general nonlinear programming problems
Experimentation in optimization
A Mehrotra-type second-order predictor–corrector algorithm for nonlinear complementarity problems over symmetric cones
A new infeasible Mehrotra-type predictor-corrector algorithm for nonlinear complementarity problems over symmetric cones
A derivative-free trust region algorithm with nonmonotone filter technique for bound constrained optimization
A globally convergent primal-dual interior-point relaxation method for nonlinear programs
A globally and superlinearly convergent feasible QP-free method for nonlinear programming
An efficient feasible SQP algorithm for inequality constrained optimization
Coupling genetic algorithm with a grid search method to solve mixed integer nonlinear programming problems
A superlinearly convergent numerical algorithm for nonlinear programming
An improved interior-type feasible QP-free algorithm for inequality constrained optimization problems
Extended ant colony optimization for non-convex mixed integer nonlinear programming
A conic trust-region method and its convergence properties
A quasi-Newton modified LP-Newton method
Advances in trust region algorithms for constrained optimization
A noninterior path following algorithm for solving a class of multiobjective programming problems
Optimality conditions for problems over symmetric cones and a simple augmented Lagrangian method
A Nonmonotone Matrix-Free Algorithm for Nonlinear Equality-Constrained Least-Squares Problems
An adaptive nonmonotone line search technique for solving systems of nonlinear equations
A nonmonotone filter trust region method for nonlinear constrained optimization
A reduced Hessian algorithm with line search filter method for nonlinear programming
Mathematical programming models and algorithms for engineering design optimization
ALADIN‐—An open‐source MATLAB toolbox for distributed non‐convex optimization
A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization
A kind of QP-free feasible method
A fractional trust region method for linear equality constrained optimization
Optimality conditions for nonlinear semidefinite programming via squared slack variables
A dynamic convexized method for nonconvex mixed integer nonlinear programming
An active set RQP algorithm for engineering design optimization
Sequential systems of linear equations algorithm for nonlinear optimization problems -- general constrained problems.
A continuously differentiable exact penalty function for nonlinear programming problems with unbounded feasible set
A superlinearly convergent hybrid algorithm for solving nonlinear programming
A successive quadratic programming method that uses new corrections for search directions
An approximate approach of global optimization for polynomial programming problems
Numerical experience with a derivative-free trust-funnel method for nonlinear optimization problems with general nonlinear constraints
A Newton-Type Globally Convergent Interior-Point Method To Solve Multi-Objective Optimization Problems
Computing the sparsity pattern of Hessians using automatic differentiation
A trust-region SQP method without a penalty or a filter for nonlinear programming
A hybrid method combining continuous tabu search and Nelder--Mead simplex algorithms for the global optimization of multiminima functions
Two differential equation systems for equality-constrained optimization
A trust region method with project step for bound constrained optimization without compact condition
Higher-order reverse automatic differentiation with emphasis on the third-order
Analysis and implementation of a dual algorithm for constrained optimization
A general method for solving constrained optimization problems
An improved nonmonotone filter trust region method for equality constrained optimization
A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences
An inexact first-order method for constrained nonlinear optimization
An inexact projected LM type algorithm for solving convex constrained nonlinear equations
Finitely convergent \(\varepsilon\)-generalized projection algorithm for nonlinear systems
\textit{Helios}: A modeling language for global optimization and its implementation in \textit{Newton}
A new finitely convergent algorithm for systems of nonlinear inequalities
A gentle introduction to Numerica
A QP-free algorithm of quasi-strongly sub-feasible directions for inequality constrained optimization
Extension of modified Polak-Ribière-Polyak conjugate gradient method to linear equality constraints minimization problems
Nonlinear programming on a microcomputer
A central path interior point method for nonlinear programming and its local convergence
Application of sequential quadratic programming software program to an actual problem
Inexact sequential quadratic optimization with penalty parameter updates within the QP solver
Some experiments on heuristic code selection versus numerical performance in nonlinear programming
An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
Global optimization test problems based on random field composition
A feasible QP-free algorithm combining the interior-point method with active set for constrained optimization
A hybrid epigraph directions method for nonsmooth and nonconvex constrained optimization via generalized augmented Lagrangian duality and a genetic algorithm

This page was built for publication: Test example for nonlinear programming codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1252157)