Pages that link to "Item:Q1252157"

The following pages link to Test example for nonlinear programming codes (Q1252157):

Displaying 50 items.

• A method combining genetic algorithm with simultaneous perturbation stochastic approximation for linearly constrained stochastic optimization problems (Q266014) (← links)
• A new penalty-free-type algorithm based on trust region techniques (Q387487) (← links)
• An improved interior-type feasible QP-free algorithm for inequality constrained optimization problems (Q437832) (← links)
• Global optimization test problems based on random field composition (Q523165) (← links)
• A reduced Hessian algorithm with line search filter method for nonlinear programming (Q544068) (← links)
• A dynamic convexized method for nonconvex mixed integer nonlinear programming (Q547132) (← links)
• A hybrid method combining continuous tabu search and Nelder--Mead simplex algorithms for the global optimization of multiminima functions (Q706948) (← links)
• A critical review of discrete filled function methods in solving nonlinear discrete optimization problems (Q708127) (← links)
• Application of sequential quadratic programming software program to an actual problem (Q811407) (← links)
• An efficient feasible SQP algorithm for inequality constrained optimization (Q837710) (← links)
• Finitely convergent \(\varepsilon\)-generalized projection algorithm for nonlinear systems (Q884390) (← links)
• A nonmonotone filter trust region method for nonlinear constrained optimization (Q953386) (← links)
• A feasible QP-free algorithm combining the interior-point method with active set for constrained optimization (Q979866) (← links)
• A new finitely convergent algorithm for systems of nonlinear inequalities (Q1001117) (← links)
• Extended ant colony optimization for non-convex mixed integer nonlinear programming (Q1013399) (← links)
• A conic trust-region method and its convergence properties (Q1029835) (← links)
• A general method for solving constrained optimization problems (Q1058991) (← links)
• An active set RQP algorithm for engineering design optimization (Q1075123) (← links)
• Experimentation in optimization (Q1084342) (← links)
• Coupling genetic algorithm with a grid search method to solve mixed integer nonlinear programming problems (Q1130405) (← links)
• A gentle introduction to Numerica (Q1274762) (← links)
• Advances in trust region algorithms for constrained optimization (Q1294548) (← links)
• An approximate approach of global optimization for polynomial programming problems (Q1296128) (← links)
• A continuously differentiable exact penalty function for nonlinear programming problems with unbounded feasible set (Q1319684) (← links)
• Analysis and implementation of a dual algorithm for constrained optimization (Q1321425) (← links)
• \textit{Helios}: A modeling language for global optimization and its implementation in \textit{Newton} (Q1391927) (← links)
• Sequential systems of linear equations algorithm for nonlinear optimization problems -- general constrained problems. (Q1412598) (← links)
• A noninterior path following algorithm for solving a class of multiobjective programming problems (Q1719236) (← links)
• A derivative-free trust region algorithm with nonmonotone filter technique for bound constrained optimization (Q1721017) (← links)
• A hybrid epigraph directions method for nonsmooth and nonconvex constrained optimization via generalized augmented Lagrangian duality and a genetic algorithm (Q1721580) (← links)
• Extension of modified Polak-Ribière-Polyak conjugate gradient method to linear equality constraints minimization problems (Q1725277) (← links)
• A fractional trust region method for linear equality constrained optimization (Q1727480) (← links)
• A new infeasible Mehrotra-type predictor-corrector algorithm for nonlinear complementarity problems over symmetric cones (Q1743538) (← links)
• Some experiments on heuristic code selection versus numerical performance in nonlinear programming (Q1804054) (← links)
• Induction heating processes optimization: A general optimal control approach (Q1873426) (← links)
• A successive quadratic programming method that uses new corrections for search directions (Q1919937) (← links)
• A superlinearly convergent numerical algorithm for nonlinear programming (Q1926210) (← links)
• An improved nonmonotone filter trust region method for equality constrained optimization (Q1949431) (← links)
• DEFT-FUNNEL: an open-source global optimization solver for constrained grey-box and black-box problems (Q2245001) (← links)
• A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences (Q2252398) (← links)
• An improved sequential quadratic programming algorithm for solving general nonlinear programming problems (Q2257747) (← links)
• An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs (Q2274851) (← links)
• Two differential equation systems for equality-constrained optimization (Q2383837) (← links)
• Optimality conditions for nonlinear semidefinite programming via squared slack variables (Q2413085) (← links)
• Mathematical programming models and algorithms for engineering design optimization (Q2495616) (← links)
• A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization (Q2510002) (← links)
• A QP-free algorithm of quasi-strongly sub-feasible directions for inequality constrained optimization (Q2514657) (← links)
• A trust-region SQP method without a penalty or a filter for nonlinear programming (Q2515095) (← links)
• A kind of QP-free feasible method (Q2519715) (← links)
• A globally and superlinearly convergent feasible QP-free method for nonlinear programming (Q2572703) (← links)