Pages that link to "Item:Q1111932"

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

Displaying 50 items.

• A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity (Q273251) (← links)
• A dwindling filter trust region algorithm for nonlinear optimization (Q279130) (← links)
• A trust-region algorithm combining line search filter method with Lagrange merit function for nonlinear constrained optimization (Q297724) (← links)
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
• Test problem generator for unconstrained global optimization (Q337165) (← links)
• CARTopt: a random search method for nonsmooth unconstrained optimization (Q377726) (← links)
• Manifold relaxations for integer programming (Q380594) (← links)
• Improvements to single-objective constrained predator-prey evolutionary optimization algorithm (Q381469) (← links)
• PyOpt: a python-based object-oriented framework for nonlinear constrained optimization (Q381697) (← links)
• Global convergence of a nonmonotone filter method for equality constrained optimization (Q440887) (← links)
• On \(D\)-optimality based trust regions for black-box optimization problems (Q445445) (← links)
• Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts (Q453612) (← links)
• Superlinearly convergent exact penalty methods with projected structured secant updates for constrained nonlinear least squares (Q467412) (← links)
• An affine scaling derivative-free trust region method with interior backtracking technique for bounded-constrained nonlinear programming (Q488945) (← links)
• A nonmonotone hybrid method of conjugate gradient and Lanczos-type for solving nonlinear systems (Q489124) (← links)
• A penalty derivative-free algorithm for nonlinear constrained optimization (Q497458) (← links)
• A combined SQP-IPM algorithm for solving large-scale nonlinear optimization problems (Q499683) (← links)
• Global optimization test problems based on random field composition (Q523165) (← links)
• An improved strongly sub-feasible SSLE method for optimization problems and numerical experiments (Q531641) (← links)
• A robust implementation of a sequential quadratic programming algorithm with successive error restoration (Q537640) (← links)
• Interval uncertainty-based robust optimization for convex and non-convex quadratic programs with applications in network infrastructure planning (Q539107) (← links)
• A reduced Hessian algorithm with line search filter method for nonlinear programming (Q544068) (← links)
• An accurate active set Newton algorithm for large scale bound constrained optimization. (Q548593) (← links)
• A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity (Q556270) (← links)
• Use of the minimum norm search direction in a nonmonotone version of the Gauss-Newton method (Q597160) (← links)
• An active set strategy based on the multiplier function or the gradient. (Q622855) (← links)
• A filter secant method with nonmonotone line search for equality constrained optimization (Q625685) (← links)
• A new sequential systems of linear equations algorithm of feasible descent for inequality constrained optimization (Q627582) (← links)
• Extending and relating different approaches for solving fuzzy quadratic problems (Q635935) (← links)
• Local convergence of a trust-region algorithm with line search filter technique for nonlinear constrained optimization (Q668547) (← links)
• On the global convergence of a modified augmented Lagrangian linesearch interior-point Newton method for nonlinear programming (Q700757) (← links)
• Solving nonlinear programming problems with noisy function values and noisy gradients (Q700766) (← links)
• A critical review of discrete filled function methods in solving nonlinear discrete optimization problems (Q708127) (← links)
• A trajectory-based method for constrained nonlinear optimization problems (Q725880) (← links)
• Application of sequential quadratic programming software program to an actual problem (Q811407) (← links)
• A class of derivative-free trust-region methods with interior backtracking technique for nonlinear optimization problems subject to linear inequality constraints (Q824557) (← links)
• Nonmonotone trust-region method for nonlinear programming with general constraints and simple bounds (Q852152) (← links)
• A multiobjective evolutionary algorithm for approximating the efficient set (Q853053) (← links)
• A modified quasi-Newton method for structured optimization with partial information on the Hessian (Q853668) (← links)
• A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization (Q858741) (← links)
• A strongly convergent norm-relaxed method of strongly sub-feasible direction for optimization with nonlinear equality and inequality constraints (Q861188) (← links)
• A quasi-Newton based pattern search algorithm for unconstrained optimization (Q864827) (← links)
• Augmented penalty algorithms based on BFGS secant approximations and trust regions (Q870306) (← links)
• A new discrete filled function algorithm for discrete global optimization (Q875372) (← links)
• Discrete global descent method for discrete global optimization and nonlinear integer programming (Q878221) (← links)
• Finitely convergent \(\varepsilon\)-generalized projection algorithm for nonlinear systems (Q884390) (← links)
• A dwindling filter line search algorithm for nonlinear equality constrained optimization (Q904938) (← links)
• Recursive quadratic programming algorithm that uses an exact augmented Lagrangian function (Q911471) (← links)
• A new quasi-Newton pattern search method based on symmetric rank-one update for unconstrained optimization (Q931755) (← links)
• A nonmonotone filter trust region method for nonlinear constrained optimization (Q953386) (← links)