Pages that link to "Item:Q4651962"

The following pages link to A Globally Convergent Filter Method for Nonlinear Programming (Q4651962):

Displaying 50 items.

• An inexact restoration approach to optimization problems with multiobjective constraints under weighted-sum scalarization (Q315505) (← links)
• Inexact restoration method for minimization problems arising in electronic structure calculations (Q409270) (← links)
• Inexact restoration method for nonlinear optimization without derivatives (Q492056) (← links)
• A trust-region approach with novel filter adaptive radius for system of nonlinear equations (Q501965) (← links)
• An inexact restoration derivative-free filter method for nonlinear programming (Q520323) (← links)
• A filter secant method with nonmonotone line search for equality constrained optimization (Q625685) (← links)
• Sequential quadratic programming with a flexible step acceptance strategy (Q693514) (← links)
• A nonmonotone filter method for nonlinear optimization (Q694518) (← links)
• A filter-line-search method for unconstrained optimization (Q711526) (← links)
• Filter-based stochastic algorithm for global optimization (Q785632) (← links)
• Partial spectral projected gradient method with active-set strategy for linearly constrained optimization (Q849145) (← links)
• Local convergence of an inexact-restoration method and numerical experiments (Q850815) (← links)
• Global convergence of trust-region algorithms for convex constrained minimization without derivatives (Q902511) (← links)
• A dwindling filter line search algorithm for nonlinear equality constrained optimization (Q904938) (← links)
• Global convergence of slanting filter methods for nonlinear programming (Q932546) (← links)
• Generalization: One technique of computational and applied mathematical methodology (Q932560) (← links)
• A bundle-filter method for nonsmooth convex constrained optimization (Q959944) (← links)
• A new line search inexact restoration approach for nonlinear programming (Q975358) (← links)
• Global convergence of a tri-dimensional filter SQP algorithm based on the line search method (Q999072) (← links)
• Gauss-Newton-based BFGS method with filter for unconstrained minimization (Q1021654) (← links)
• A filter inexact-restoration method for nonlinear programming (Q1024701) (← links)
• A derivative-free trust region algorithm with nonmonotone filter technique for bound constrained optimization (Q1721017) (← links)
• Filter-based adaptive Kriging method for black-box optimization problems with expensive objective and constraints (Q1987853) (← links)
• A derivative-free method for solving box-constrained underdetermined nonlinear systems of equations (Q2019006) (← links)
• A filter proximal bundle method for nonsmooth nonconvex constrained optimization (Q2022218) (← links)
• A derivative-free trust-region algorithm with copula-based models for probability maximization problems (Q2076911) (← links)
• Non-monotone inexact restoration method for nonlinear programming (Q2191795) (← links)
• On optimization strategies for parameter estimation in models governed by partial differential equations (Q2228648) (← links)
• Assessing the reliability of general-purpose inexact restoration methods (Q2255712) (← links)
• A flexible inexact-restoration method for constrained optimization (Q2346395) (← links)
• A line search filter-SQP method with Lagrangian function for nonlinear inequality constrained optimization (Q2364355) (← links)
• Sequential equality-constrained optimization for nonlinear programming (Q2374366) (← links)
• A non-monotone line search multidimensional filter-SQP method for general nonlinear programming (Q2430756) (← links)
• A nonmonotone line search filter method with reduced Hessian updating for nonlinear optimization (Q2439887) (← links)
• Global convergence of a general filter algorithm based on an efficiency condition of the step (Q2453360) (← links)
• Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties (Q2494514) (← links)
• A trust-region SQP method without a penalty or a filter for nonlinear programming (Q2515095) (← links)
• A line search SQP method without a penalty or a filter (Q2516801) (← links)
• Numerical comparison of merit function with filter criterion in inexact restoration algorithms using hard-spheres problems (Q2655405) (← links)
• Optimal non-anticipative scenarios for nonlinear hydro-thermal power systems (Q2660091) (← links)
• Inexact Restoration approach for minimization with inexact evaluation of the objective function (Q2796018) (← links)
• Global convergence of a derivative-free inexact restoration filter algorithm for nonlinear programming (Q2970395) (← links)
• An exact penalty-Lagrangian approach for large-scale nonlinear programming (Q2996800) (← links)
• Local convergence of filter methods for equality constrained non-linear programming (Q3066927) (← links)
• A nonmonotone SQP-filter method for equality constrained optimization (Q3066990) (← links)
• A filter-trust-region method for LC 1 unconstrained optimization and its global convergence (Q3538600) (← links)
• Global convergence of a filter-trust-region algorithm for solving nonsmooth equations (Q3568420) (← links)
• The Sequential Quadratic Programming Method (Q3569505) (← links)
• On the Complexity of an Inexact Restoration Method for Constrained Optimization (Q5210514) (← links)
• Derivative-free optimization methods (Q5230522) (← links)