Pages that link to "Item:Q3358159"

The following pages link to Avoiding the Maratos Effect by Means of a Nonmonotone Line Search I. General Constrained Problems (Q3358159):

Displaying 50 items.

• An efficient nonmonotone trust-region method for unconstrained optimization (Q411524) (← links)
• A filter algorithm for nonlinear systems of equalities and inequalities (Q449489) (← links)
• Modified nonmonotone Armijo line search for descent method (Q535246) (← links)
• A kind of nonmonotone filter method for nonlinear complementarity problem (Q545563) (← links)
• A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity (Q556270) (← links)
• Convergence properties of nonmonotone spectral projected gradient methods (Q557737) (← links)
• A non-monotone line search algorithm for unconstrained optimization (Q618548) (← links)
• Nonmonotone algorithm for minimax optimization problems (Q632859) (← links)
• Switching stepsize strategies for sequential quadratic programming (Q635801) (← links)
• A new class of nonmonotone conjugate gradient training algorithms (Q669374) (← links)
• Global convergence of nonmonotone descent methods for unconstrained optimization problems (Q697549) (← links)
• Nonmonotone trust-region method for nonlinear programming with general constraints and simple bounds (Q852152) (← links)
• A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function (Q939555) (← links)
• Global convergence of the nonmonotone MBFGS method for nonconvex unconstrained minimization (Q953368) (← links)
• A penalty-function-free line search SQP method for nonlinear programming (Q1019803) (← links)
• A globally convergent BFGS method with nonmonotone line search for non-convex minimization (Q1026434) (← links)
• A modified SQP method with nonmonotone technique and its global convergence (Q1029867) (← links)
• Nonmonotone trust region methods with curvilinear path in unconstrained optimization (Q1195967) (← links)
• A class of nonmonotone trust region algorithms for unconstrained optimization problems (Q1286707) (← links)
• A new technique for inconsistent QP problems in the SQP method (Q1298765) (← links)
• Nonmonotone line search for minimax problems (Q1321311) (← links)
• A class of nonmonotone stabilization trust region methods (Q1337634) (← links)
• The convergence of equilibrium algorithms with non-monotone line search technique. (Q1415258) (← links)
• Combining trust region and linesearch algorithm for equality constrained optimization (Q1428992) (← links)
• An extended nonmonotone line search technique for large-scale unconstrained optimization (Q1675990) (← links)
• On the nonmonotonicity degree of nonmonotone line searches (Q1697277) (← links)
• A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity (Q1765848) (← links)
• A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization (Q1769069) (← links)
• Wing aerodynamic optimization using efficient mathematically-extracted modal design variables (Q1787330) (← links)
• Nonmonotone line search algorithm for constrained minimax problems (Q1812065) (← links)
• Numerical study of a smoothing algorithm for the complementarity system over the second-order cone (Q1993579) (← links)
• A new trust region method for solving least-square transformation of system of equalities and inequalities (Q2017830) (← links)
• On the inexact scaled gradient projection method (Q2070333) (← links)
• A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences (Q2252398) (← links)
• A class on nonmonotone stabilization methods in unconstrained optimization (Q2277146) (← links)
• On efficiency of nonmonotone Armijo-type line searches (Q2284837) (← links)
• Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems (Q2329657) (← links)
• A relaxed nonmonotone adaptive trust region method for solving unconstrained optimization problems (Q2350863) (← links)
• A nonmonotonic hybrid algorithm for min-max problem (Q2357826) (← 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)
• An adaptive nonmonotone trust-region method with curvilinear search for minimax problem (Q2451442) (← links)
• An inexact line search approach using modified nonmonotone strategy for unconstrained optimization (Q2453471) (← links)
• Parameter optimization using the \(L_\infty \) exact penalty function and strictly convex quadratic programming problems (Q2483248) (← links)
• An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity (Q2485397) (← links)
• Two globally convergent nonmonotone trust-region methods for unconstrained optimization (Q2634354) (← links)
• An SQP-based multiple shooting algorithm for large-scale PDE-constrained optimal control problems (Q2683230) (← links)
• A class of nonmonotone Armijo-type line search method for unconstrained optimization (Q2903129) (← links)
• A non-monotone trust region algorithm for unconstrained optimization with dynamic reference iteration updates using filter (Q2903152) (← links)
• Convergence properties of inexact projected gradient methods (Q3446583) (← links)