The following pages link to Differential gradient methods (Q1257325):
Displaying 17 items.
- Local convergence of the steepest descent method in Hilbert spaces (Q703669) (← links)
- A trajectory-based method for constrained nonlinear optimization problems (Q725880) (← links)
- Constrained optimization: Projected gradient flows (Q1024245) (← links)
- A general method for solving constrained optimization problems (Q1058991) (← links)
- Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations (Q1106732) (← links)
- An efficient curvilinear method for the minimization of a nonlinear function subject to linear inequality constraints (Q1134629) (← links)
- A class of differential descent methods for constrained optimization (Q1146118) (← links)
- Constrained optimization along geodesics (Q1160888) (← links)
- A curvilinear optimization method based upon iterative estimation of the eigensystem of the Hessian matrix (Q1248807) (← links)
- A class of methods for unconstrained minimization based on stable numerical integration techniques (Q1257326) (← links)
- A Newton-type curvilinear search method for constrained optimization (Q1258596) (← links)
- K-K-T multiplier estimates and objective function lower bounds from projective SUMT (Q1316100) (← links)
- A new descent algorithm with curve search rule (Q1764727) (← links)
- Note on global convergence of ODE methods for unconstrained optimization (Q1855132) (← links)
- A comparison of methods for traversing regions of non-convexity in optimization problems (Q2192582) (← links)
- Optimal homotopy asymptotic method-least square for solving nonlinear fractional-order gradient-based dynamic system from an optimization problem (Q2246558) (← links)
- A new super-memory gradient method with curve search rule (Q2571993) (← links)
