Pages that link to "Item:Q1765264"

The following pages link to Levenberg-Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints (Q1765264):

Displaying 15 items.

• Feasibility problems with complementarity constraints (Q320869) (← links)
• Global complexity bound analysis of the Levenberg-Marquardt method for nonsmooth equations and its application to the nonlinear complementarity problem (Q415364) (← links)
• A box-constrained differentiable penalty method for nonlinear complementarity problems (Q496621) (← links)
• Truncated regularized Newton method for convex minimizations (Q842780) (← links)
• On the convergence of an inexact Newton-type method (Q867927) (← links)
• Convergence analysis of nonmonotone Levenberg-Marquardt algorithms for complementarity problem (Q972943) (← links)
• A simulation-based evolutionary approach to LNA circuit design optimization (Q1008624) (← links)
• A nonmonotone projection method for constrained system of nonlinear equations (Q1993198) (← links)
• A projection method for convex constrained monotone nonlinear equations with applications (Q2006525) (← links)
• An inverse problem involving a viscous eikonal equation with applications in electrophysiology (Q2054698) (← links)
• A unified derivative-free projection method model for large-scale nonlinear equations with convex constraints (Q2165796) (← links)
• A modified spectral PRP conjugate gradient projection method for solving large-scale monotone equations and its application in compressed sensing (Q2298534) (← links)
• A smoothing Levenberg-Marquardt algorithm for semi-infinite programming (Q2352422) (← links)
• A Smoothing Projected Levenberg-Marquardt Type Algorithm for Solving Constrained Equations (Q2795093) (← links)
• A complementarity model and algorithm for multi-commodity flow supply chain network equilibrium with random demands (Q6048214) (← links)