A multi-step curve search algorithm in nonlinear optimization: nondifferentiable convex case
From MaRDI portal
Publication:2853249
Recommendations
Cited in
(11)- Accelerated double direction method for solving unconstrained optimization problems
- On the Hybridization of the Double Step Length Method for Solving System of Nonlinear Equations
- An accelerated double step size model in unconstrained optimization
- An improved derivative-free method via double direction approach for solving systems of nonlinear equations
- A multi-step curve search algorithm in nonlinear optimization
- Hybrid modification of accelerated double direction method
- On solving double direction methods for convex constrained monotone nonlinear equations with image restoration
- Modification of the double direction approach for solving systems of nonlinear equations with application to Chandrasekhar's integral equation
- A minimizing algorithm for complex nonconvex nondifferentiable functions
- A transformation of accelerated double step size method for unconstrained optimization
- Convergence of multi-step curve search method for unconstrained optimization
This page was built for publication: A multi-step curve search algorithm in nonlinear optimization: nondifferentiable convex case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2853249)