Pages that link to "Item:Q1148785"

The following pages link to Test examples for nonlinear programming codes (Q1148785):

Displaying 50 items.

• Differential systems for constrained optimization via a nonlinear augmented Lagrangian (Q272481) (← links)
• A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity (Q273251) (← links)
• An exact penalty function based on the projection matrix (Q278572) (← links)
• A dwindling filter trust region algorithm for nonlinear optimization (Q279130) (← links)
• Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems (Q280099) (← links)
• A trust-region algorithm combining line search filter method with Lagrange merit function for nonlinear constrained optimization (Q297724) (← links)
• An interior-point penalty active-set trust-region algorithm (Q334604) (← links)
• Test problem generator for unconstrained global optimization (Q337165) (← links)
• Biogeography-based optimization for constrained optimization problems (Q339689) (← links)
• RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems (Q340017) (← links)
• Solving unbounded box constrained variational inequalities via a homotopy method (Q343882) (← links)
• A polynomial interior-point algorithm for monotone linear complementarity problems (Q353166) (← links)
• A double-multiplicative dynamic penalty approach for constrained evolutionary optimization (Q373947) (← links)
• CARTopt: a random search method for nonsmooth unconstrained optimization (Q377726) (← links)
• A feasible directions algorithm for nonlinear complementarity problems and applications in mechanics (Q381248) (← links)
• Improvements to single-objective constrained predator-prey evolutionary optimization algorithm (Q381469) (← links)
• Pareto set analysis: local measures of objective coupling in multiobjective design optimization (Q381593) (← links)
• PyOpt: a python-based object-oriented framework for nonlinear constrained optimization (Q381697) (← links)
• A tri-dimensional filter SQP algorithm for variational inequality problems (Q382458) (← links)
• Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality (Q386447) (← links)
• Global optimization of bilinear programs with a multiparametric disaggregation technique (Q386453) (← links)
• A derivative-free algorithm for linearly constrained optimization problems (Q404515) (← links)
• Coupled eagle strategy and differential evolution for unconstrained and constrained global optimization (Q418316) (← links)
• A polynomial arc-search interior-point algorithm for convex quadratic programming (Q421610) (← links)
• On the local convergence of a derivative-free algorithm for least-squares minimization (Q429479) (← links)
• Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms (Q434187) (← links)
• An improved interior-type feasible QP-free algorithm for inequality constrained optimization problems (Q437832) (← links)
• Global convergence of a nonmonotone filter method for equality constrained optimization (Q440887) (← links)
• An intelligent moving object optimization algorithm for design problems with mixed variables, mixed constraints and multiple objectives (Q445473) (← links)
• Interior-point methods for nonconvex nonlinear programming: cubic regularization (Q457205) (← links)
• Superlinearly convergent exact penalty methods with projected structured secant updates for constrained nonlinear least squares (Q467412) (← links)
• Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality (Q480827) (← links)
• Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization (Q480926) (← links)
• Sequential quadratic programming methods for parametric nonlinear optimization (Q480928) (← links)
• An extension of the Fletcher-Reeves method to linear equality constrained optimization problem (Q482439) (← links)
• A family of the local convergence of the improved secant methods for nonlinear equality constrained optimization subject to bounds on variables (Q488922) (← links)
• Inexact restoration method for nonlinear optimization without derivatives (Q492056) (← links)
• An adaptive augmented Lagrangian method for large-scale constrained optimization (Q494324) (← links)
• A modified weighted pairwise likelihood estimator for a class of random effects models (Q497093) (← links)
• A penalty derivative-free algorithm for nonlinear constrained optimization (Q497458) (← links)
• Conjugate gradient path method without line search technique for derivative-free unconstrained optimization (Q501963) (← links)
• An inexact restoration derivative-free filter method for nonlinear programming (Q520323) (← links)
• A new trust-region method for solving systems of equalities and inequalities (Q520331) (← 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)
• The extrapolated interval global optimization algorithm (Q540704) (← links)
• The use of QP-free algorithm in the limit analysis of slope stability (Q544226) (← links)
• A modified SLP algorithm and its global convergence (Q548334) (← links)
• A modified QP-free feasible method (Q552398) (← links)
• A new smoothing Newton method for solving constrained nonlinear equations (Q555395) (← links)