The following pages link to (Q3908413):
Displaying 17 items.
- A Dai-Yuan-type Riemannian conjugate gradient method with the weak Wolfe conditions (Q276855) (← links)
- Projection-based iterative mode scheduling for switched systems (Q286059) (← links)
- An accelerated double step size model in unconstrained optimization (Q902839) (← links)
- Acceleration of conjugate gradient algorithms for unconstrained optimization (Q1029371) (← links)
- A linear programming-based optimization algorithm for solving nonlinear programming problems (Q1044083) (← links)
- Descent algorithm for a class of convex nondifferentiable functions (Q1321148) (← links)
- A modified conjugacy condition and related nonlinear conjugate gradient method (Q1718989) (← links)
- Accelerated double direction method for solving unconstrained optimization problems (Q1719483) (← links)
- A hybrid of DL and WYL nonlinear conjugate gradient methods (Q1723746) (← links)
- Hybridization of accelerated gradient descent method (Q1989937) (← links)
- Computer Algebra and Line Search (Q3086910) (← links)
- A Projected Gradient and Constraint Linearization Method for Nonlinear Model Predictive Control (Q4563378) (← links)
- Riemannian Conjugate Gradient Methods: General Framework and Specific Algorithms with Convergence Analyses (Q5051377) (← links)
- A Nonsmooth Trust-Region Method for Locally Lipschitz Functions with Application to Optimization Problems Constrained by Variational Inequalities (Q5116553) (← links)
- Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems (Q5860819) (← links)
- Essentials of numerical nonsmooth optimization (Q5918756) (← links)
- Semismoothness for Solution Operators of Obstacle-Type Variational Inequalities with Applications in Optimal Control (Q6101533) (← links)
