Pages that link to "Item:Q4742570"

The following pages link to Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions (Q4742570):

Displaying 19 items.

• Relaxation methods for monotropic programs (Q909583) (← links)
• A quadratic approximation method for minimizing a class of quasidifferentiable functions (Q1063391) (← links)
• Decomposition method of descent for minimizing the sum of convex nonsmooth functions (Q1071652) (← links)
• A bracketing technique to ensure desirable convergence in univariate minimization (Q1115354) (← links)
• Bounding separable recourse functions with limited distribution information (Q1178445) (← links)
• Convergence analysis of some methods for minimizing a nonsmooth convex function (Q1265007) (← links)
• Descent algorithm for a class of convex nondifferentiable functions (Q1321148) (← links)
• Extension of the Frank-Wolfe algorithm to concave nondifferentiable objective functions (Q1321376) (← links)
• A rapidly convergent five-point algorithm for univariate minimization (Q1321651) (← links)
• Separating plane algorithms for convex optimization (Q1356051) (← links)
• A fast gradient and function sampling method for finite-max functions (Q1756577) (← links)
• Convergence of line search methods for unconstrained optimization (Q1881700) (← links)
• A quasi-second-order proximal bundle algorithm (Q1915808) (← links)
• A \(\mathcal{VU}\)-algorithm for convex minimization (Q2576737) (← links)
• On superlinear convergence in univariate nonsmooth minimization (Q2640452) (← links)
• Stationarity and superlinear convergence of an algorithm for univariate locally lipschitz constrained minimization (Q3310490) (← links)
• A descent algorithm for nonsmooth convex optimization (Q3337229) (← links)
• Descent methods for composite nondifferentiable optimization problems (Q3705231) (← links)
• A new class of memory gradient methods with inexact line searches (Q4675852) (← links)