The following pages link to (Q4194749):
Displaying 19 items.
- An infeasible-point subgradient method using adaptive approximate projections (Q461434) (← links)
- About Lagrangian methods in integer optimization (Q817183) (← links)
- Optimization with nonsmooth data (Q1097840) (← links)
- Subgradient methods for sharp weakly convex functions (Q1626538) (← links)
- Lagrangean relaxation. (With comments and rejoinder). (Q1876461) (← links)
- A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods (Q1986106) (← links)
- A derivative-free trust-region algorithm for composite nonsmooth optimization (Q2013620) (← links)
- A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem (Q2158622) (← links)
- A modified proximal point method for DC functions on Hadamard manifolds (Q2191784) (← links)
- A simple nearly optimal restart scheme for speeding up first-order methods (Q2696573) (← links)
- A hybrid algorithm of local search for the heterogeneous fixed fleet vehicle routing problem (Q3186841) (← links)
- First Order Methods for Optimization on Riemannian Manifolds (Q3300552) (← links)
- Iteration-complexity of the subgradient method on Riemannian manifolds with lower bounded curvature (Q4631817) (← links)
- Proximal Gradient Methods for Machine Learning and Imaging (Q5028165) (← links)
- A Projected Subgradient Method for the Computation of Adapted Metrics for Dynamical Systems (Q5056852) (← links)
- Essentials of numerical nonsmooth optimization (Q5918756) (← links)
- Essentials of numerical nonsmooth optimization (Q5970841) (← links)
- Statistical performance of subgradient step-size update rules in Lagrangian relaxations of chance-constrained optimization models (Q6588762) (← links)
- High probability bounds for stochastic subgradient schemes with heavy tailed noise] (Q6633045) (← links)
