Pages that link to "Item:Q1111932"

The following pages link to More test examples for nonlinear programming codes (Q1111932):

Displaying 50 items.

• Derivative-free methods for bound constrained mixed-integer optimization (Q1928748) (← links)
• Benchmarking nonlinear optimization software in technical computing environments (Q1948530) (← links)
• An improved nonmonotone filter trust region method for equality constrained optimization (Q1949431) (← links)
• A perturbed version of an inexact generalized Newton method for solving nonsmooth equations (Q1952309) (← links)
• A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints (Q2044568) (← links)
• A theoretical and empirical comparison of gradient approximations in derivative-free optimization (Q2143221) (← links)
• A new QPSO based hybrid algorithm for constrained optimization problems via tournamenting process (Q2156463) (← links)
• A novel projected gradient-like method for optimization problems with simple constraints (Q2190861) (← links)
• Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems (Q2250067) (← links)
• A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences (Q2252398) (← links)
• A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization (Q2363570) (← links)
• Global convergence of a new nonmonotone filter method for equality constrained optimization (Q2375740) (← links)
• A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization (Q2378276) (← links)
• Two differential equation systems for equality-constrained optimization (Q2383837) (← links)
• Global convergence and the Powell singular function (Q2392109) (← links)
• A self-organizing migrating genetic algorithm for constrained optimization (Q2425979) (← links)
• A nonmonotone line search filter method with reduced Hessian updating for nonlinear optimization (Q2439887) (← links)
• A new class of test functions for global optimization (Q2460145) (← links)
• An affine scaling interior algorithm via Lanczos path for solving bound-constrained nonlinear systems (Q2470164) (← links)
• Finding discrete global minima with a filled function for integer programming (Q2477662) (← links)
• An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity (Q2485397) (← links)
• Discrete filled function method for discrete global optimization (Q2487474) (← links)
• A new filled function method for nonlinear integer programming problem (Q2489450) (← links)
• A penalty-free-type nonmonotone trust-region method for nonlinear constrained optimization (Q2489456) (← links)
• On memory gradient method with trust region for unconstrained optimization (Q2492798) (← links)
• A sequential cutting plane algorithm for solving convex NLP problems (Q2496070) (← links)
• A trust-region and affine scaling algorithm for linearly constrained optimization (Q2503848) (← links)
• A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization (Q2510002) (← links)
• Solving unconstrained optimization problem with a filter-based nonmonotone pattern search algorithm (Q2518730) (← links)
• Efficient hybrid methods for global continuous optimization based on simulated annealing (Q2571196) (← links)
• A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization (Q2572648) (← links)
• A superlinearly convergent hybrid algorithm for solving nonlinear programming (Q2628199) (← links)
• Inverse analysis method using MPP-based dimension reduction for reliability-based design optimization of nonlinear and multi-dimensional systems (Q2638108) (← links)
• Computing shadow prices with multiple Lagrange multipliers (Q2666654) (← links)
• A mixed finite differences scheme for gradient approximation (Q2671431) (← links)
• A nonmonotone SQP-filter method for equality constrained optimization (Q3066990) (← links)
• A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization (Q3506289) (← links)
• General primal-dual penalty/barrier path-following Newton methods for nonlinear programming (Q3534650) (← links)
• A robust SQP method based on a smoothing lower order penalty function† (Q3622004) (← links)
• Generalized monotone line search SQP algorithm for constrained minimax problems (Q3622010) (← links)
• FITTING OF TABU SEARCH TO OPTIMIZE FUNCTIONS OF CONTINUOUS VARIABLES (Q4362133) (← links)
• An approach to multi-start clustering for global optimization with non-linear constraints (Q4530126) (← links)
• État de l'art des méthodes “d'optimisation globale” (Q4531458) (← links)
• A sharp augmented Lagrangian-based method in constrained non-convex optimization (Q4631763) (← links)
• Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods (Q4634094) (← links)
• A Mixed and Superlinearly Convergent Algorithm for Constrained Optimization (Q4653552) (← links)
• A general class of penalty/barrier path-following Newton methods for nonlinear programming (Q4675963) (← links)
• A variant of curved search method (Q4764847) (← links)
• Dimension Reduction Method-Based RBDO for Dependent Interval Variables (Q4987579) (← links)
• An affine scaling interior trust-region method combining with nonmonotone line search filter technique for linear inequality constrained minimization (Q5028601) (← links)