Pages that link to "Item:Q3837285"

The following pages link to Convergence of the BFGS Method for $LC^1 $ Convex Constrained Optimization (Q3837285):

Displaying 17 items.

• Convergence of an inexact generalized Newton method with a scaled residual control (Q552356) (← links)
• Local feasible QP-free algorithms for the constrained minimization of SC\(^1\) functions (Q597172) (← links)
• An inexact SQP Newton method for convex SC\(^{1}\) minimization problems (Q711698) (← links)
• A new regularized limited memory BFGS-type method based on modified secant conditions for unconstrained optimization problems (Q897051) (← links)
• An SQP algorithm with cautious updating criteria for nonlinear degenerate problems (Q1036891) (← links)
• On preconditioned Uzawa methods and SOR methods for saddle-point problems (Q1298659) (← links)
• Superlinear convergence of smoothing quasi-Newton methods for nonsmooth equations (Q1360161) (← links)
• On superlinear convergence of quasi-Newton methods for nonsmooth equations (Q1362530) (← links)
• Verification methods for nonlinear equations with saddle point functions (Q1410829) (← links)
• Globally convergent BFGS method for nonsmooth convex optimization (Q1573986) (← links)
• Newton-type methods for stochastic programming. (Q1597071) (← links)
• Globally and superlinearly convergent algorithms for the solution of box-constrained optimi\-zation (Q1827220) (← links)
• A regularized limited memory BFGS method for nonconvex unconstrained minimization (Q2248965) (← links)
• A stochastic quasi-Newton method for simulation response optimization (Q2491766) (← links)
• A filter-trust-region method for LC 1 unconstrained optimization and its global convergence (Q3538600) (← links)
• Convergence of the BFGS-SQP Method for Degenerate Problems (Q5308790) (← links)
• A practical update criterion for SQP method (Q5758221) (← links)