Pages that link to "Item:Q5957565"

The following pages link to Nonlinear programming without a penalty function. (Q5957565):

Displaying 50 items.

• On filter-successive linearization methods for nonlinear semidefinite programming (Q1047869) (← links)
• A sequential quadratic programming with a dual parametrization approach to nonlinear semi-infinite programming (Q1433470) (← links)
• A progressive barrier derivative-free trust-region algorithm for constrained optimization (Q1616931) (← links)
• Mesh-based Nelder-Mead algorithm for inequality constrained optimization (Q1616932) (← links)
• On the global convergence of a projective trust region algorithm for nonlinear equality constrained optimization (Q1633865) (← links)
• A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm (Q1650852) (← links)
• Line search filter inexact secant methods for nonlinear equality constrained optimization (Q1663551) (← links)
• Extended duality in fuzzy optimization problems (Q1666674) (← links)
• Guided dive for the spatial branch-and-bound (Q1675571) (← links)
• GOSAC: global optimization with surrogate approximation of constraints (Q1675641) (← links)
• A new restarting adaptive trust-region method for unconstrained optimization (Q1689065) (← links)
• On a two-phase approximate greatest descent method for nonlinear optimization with equality constraints (Q1713237) (← links)
• An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems (Q1717575) (← links)
• Filter trust region method for nonlinear semi-infinite programming problem (Q1720831) (← links)
• A derivative-free trust region algorithm with nonmonotone filter technique for bound constrained optimization (Q1721017) (← links)
• The flattened aggregate constraint homotopy method for nonlinear programming problems with many nonlinear constraints (Q1724113) (← links)
• A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization (Q1740436) (← links)
• Calibration of parameters in dynamic energy budget models using direct-search methods (Q1741538) (← links)
• An affine scaling interior trust-region method combining with line search filter technique for optimization subject to bounds on variables (Q1744045) (← links)
• A study of the difference-of-convex approach for solving linear programs with complementarity constraints (Q1749452) (← links)
• Direct search methods on reductive homogeneous spaces (Q1752640) (← links)
• Approximating a solution set of nonlinear inequalities (Q1754455) (← links)
• A filled function method dominated by filter for nonlinearly global optimization (Q1756190) (← links)
• A derivative-free filter method for solving nonlinear complementarity problems (Q1764731) (← links)
• A penalty-free method with line search for nonlinear equality constrained optimization (Q1792357) (← links)
• Constrained optimization involving expensive function evaluations: A sequential approach (Q1887871) (← links)
• A hybrid differential dynamic programming algorithm for constrained optimal control problems. II: Application (Q1937082) (← links)
• On the use of piecewise linear models in nonlinear programming (Q1942276) (← links)
• An improved nonmonotone filter trust region method for equality constrained optimization (Q1949431) (← links)
• An improved line search filter method for the system of nonlinear equations (Q1952809) (← links)
• UAV formation flight based on nonlinear model predictive control (Q1954586) (← links)
• A filter algorithm with inexact line search (Q1954692) (← links)
• A nonmonotone line search filter algorithm for the system of nonlinear equations (Q1955426) (← links)
• Reverse bridge theorem under constraint partition (Q1958870) (← links)
• A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties (Q1960196) (← links)
• Combining cross-entropy and MADS methods for inequality constrained global optimization (Q1981930) (← links)
• Filter-based adaptive Kriging method for black-box optimization problems with expensive objective and constraints (Q1987853) (← links)
• A method for reliability-based optimization with multiple non-normal stochastic parameters: a simplified airshed management study (Q2002001) (← links)
• Solving nearly-separable quadratic optimization problems as nonsmooth equations (Q2013144) (← links)
• A filter proximal bundle method for nonsmooth nonconvex constrained optimization (Q2022218) (← links)
• The DIRECT algorithm: 25 years later (Q2022319) (← links)
• Nonconvex constrained optimization by a filtering branch and bound (Q2038915) (← links)
• Derivative-free superiorization: principle and algorithm (Q2048824) (← links)
• Some results on the filter method for nonlinear complementary problems (Q2072787) (← links)
• A new adaptive method to nonlinear semi-infinite programming (Q2076380) (← links)
• Hierarchically constrained blackbox optimization (Q2083999) (← links)
• A penalty-free method with superlinear convergence for equality constrained optimization (Q2191791) (← links)
• A filter-type method for solving nonlinear semidefinite programming (Q2202443) (← links)
• An augmented Lagrangian filter method (Q2216190) (← links)
• A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application (Q2226311) (← links)