Pages that link to "Item:Q1386698"

The following pages link to A new method for nonsmooth convex optimization (Q1386698):

Displaying 11 items.

• A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations (Q255074) (← links)
• A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization (Q429459) (← links)
• Improved smoothing Newton methods for \(P_0\) nonlinear complementarity problems (Q732492) (← links)
• New conjugacy condition and related new conjugate gradient methods for unconstrained optimization (Q875393) (← links)
• Multivariate spectral gradient algorithm for nonsmooth convex optimization problems (Q1664763) (← links)
• Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization (Q1938913) (← links)
• A modified Dai-Liao conjugate gradient method for solving unconstrained optimization and image restoration problems (Q2142484) (← links)
• A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs (Q2252688) (← links)
• A generic result in vector optimization (Q2471841) (← links)
• The optimization for the inequalities of power means (Q2471879) (← links)
• Some new step-size rules for optimization problems (Q5436239) (← links)