Pages that link to "Item:Q2506171"

The following pages link to The Lagrangian globalization method for nonsmooth constrained equations (Q2506171):

Displaying 14 items.

• A class of parameter-free filled functions for box-constrained system of nonlinear equations (Q287871) (← links)
• A new filled function method for an unconstrained nonlinear equation (Q611845) (← links)
• Global variational methods on a class of nonsmooth nonholonomic constraints (Q697036) (← links)
• A new filled function method for nonlinear equations (Q1021533) (← links)
• A new conjugate gradient projection method for convex constrained nonlinear equations (Q2205252) (← links)
• An inexact modified subgradient algorithm for nonconvex optimization (Q2268922) (← links)
• Spectral gradient projection method for monotone nonlinear equations with convex constraints (Q2271390) (← links)
• A novel filled function method for nonlinear equations (Q2336255) (← links)
• Three derivative-free projection methods for nonlinear equations with convex constraints (Q2354200) (← links)
• A filled function method for nonlinear equations (Q2383625) (← links)
• A new auxiliary function method for systems of nonlinear equations (Q2514659) (← links)
• Globalization of Newton's Method for Solving Non-linear Equations (Q4884708) (← links)
• Partially symmetrical derivative-free Liu–Storey projection method for convex constrained equations (Q5031744) (← links)
• A derivative-free projection algorithm for solving pseudo-monotone equations with convex constraints (Q5868476) (← links)