Pages that link to "Item:Q1265406"
From MaRDI portal
The following pages link to A general approach to convergence properties of some methods for nonsmooth convex optimization (Q1265406):
Displaying 11 items.
- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations (Q255074) (← links)
- A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems (Q295480) (← links)
- A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization (Q429459) (← links)
- An SQP-type method and its application in stochastic programs (Q1411396) (← links)
- Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization (Q1938913) (← links)
- A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems (Q2069440) (← links)
- Convergence analysis on an accelerated proximal point algorithm for linearly constrained optimization problems (Q2214872) (← links)
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs (Q2252688) (← links)
- On solutions and duality of nonlinear nonsmooth fractional programs (Q2369231) (← links)
- Inexact proximal point algorithms and descent methods in optimization (Q2575251) (← links)
- Newton projection method as applied to assembly simulation (Q5038434) (← links)
