scientific article; zbMATH DE number 3634029
From MaRDI portal
Publication:4194749
zbMath0407.90072MaRDI QIDQ4194749
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (17)
Lagrangean relaxation. (With comments and rejoinder). ⋮ Subgradient methods for sharp weakly convex functions ⋮ A Projected Subgradient Method for the Computation of Adapted Metrics for Dynamical Systems ⋮ Optimization with nonsmooth data ⋮ A hybrid algorithm of local search for the heterogeneous fixed fleet vehicle routing problem ⋮ A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem ⋮ A modified proximal point method for DC functions on Hadamard manifolds ⋮ A simple nearly optimal restart scheme for speeding up first-order methods ⋮ An infeasible-point subgradient method using adaptive approximate projections ⋮ Iteration-complexity of the subgradient method on Riemannian manifolds with lower bounded curvature ⋮ First Order Methods for Optimization on Riemannian Manifolds ⋮ A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods ⋮ A derivative-free trust-region algorithm for composite nonsmooth optimization ⋮ Essentials of numerical nonsmooth optimization ⋮ Essentials of numerical nonsmooth optimization ⋮ Proximal Gradient Methods for Machine Learning and Imaging ⋮ About Lagrangian methods in integer optimization
This page was built for publication:
