Pages that link to "Item:Q1321115"
From MaRDI portal
The following pages link to New variable-metric algorithms for nondifferentiable optimization problems (Q1321115):
Displaying 17 items.
- Diagonal bundle method for nonsmooth sparse optimization (Q495735) (← links)
- Portfolio optimization by minimizing conditional value-at-risk via nondifferentiable optimization (Q989841) (← links)
- A stochastic quasigradient algorithm with variable metric (Q1207848) (← links)
- Variable-metric technique for the solution of affinely parametrized nondifferentiable optimal design problems (Q1824569) (← links)
- Numerical infinitesimals in a variable metric method for convex nonsmooth optimization (Q2422878) (← links)
- Variable programming: a generalized minimax problem. II: Algorithms (Q2488054) (← links)
- Variable metric inexact line-search-based methods for nonsmooth optimization (Q2802142) (← links)
- Subgradient and Bundle Methods for Nonsmooth Optimization (Q2838345) (← links)
- Random perturbation of the projected variable metric method for nonsmooth nonconvex optimization problems with linear constraints (Q2845108) (← links)
- Comparing different nonsmooth minimization methods and software (Q2885467) (← links)
- Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization (Q3145057) (← links)
- (Q3484644) (← links)
- (Q4246143) (← links)
- Survey of Bundle Methods for Nonsmooth Optimization (Q4806340) (← links)
- A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions (Q5058380) (← links)
- A self-correcting variable-metric algorithm framework for nonsmooth optimization (Q5109471) (← links)
- Stochastic perturbation of subgradient algorithm for nonconvex deep neural networks (Q6161107) (← links)
