A Descent Numerical Method for Optimization Problems with Nondifferentiable Cost Functionals

DOI10.1137/0311049zbMath0243.49012OpenAlexW2146131395MaRDI QIDQ5654676

Dimitri P. Bertsekas, Sanjoy K. Mitter

Publication date: 1973

Published in: SIAM Journal on Control (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/190c494a31bdf058917bd5203c122fc8736acec1

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Methods of successive quadratic programming type (90C55)

Related Items (20)

Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization ⋮ Theorems of the alternative and duality ⋮ \(\epsilon\)-subgradient method for the solution of nonlinear extremal problems ⋮ Using the ?-subgradient method to solve the dual and the primal mathematical programming problems ⋮ Unnamed Item ⋮ A subgradient projection algorithm ⋮ An infeasible-point subgradient method using adaptive approximate projections ⋮ Auction algorithms for network flow problems: A tutorial introduction ⋮ An introduction to continuous optimization for imaging ⋮ Unnamed Item ⋮ Monotone algorithm for seeking saddle point of unsmooth function ⋮ Continuous approximations to generalized jacobians ⋮ Optimization of lipschitz continuous functions ⋮ Essentials of numerical nonsmooth optimization ⋮ Conditional subgradient optimization -- theory and applications ⋮ Implementation of a subgradient projection algorithm ⋮ Subdifferentials of functions on sets ⋮ A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems ⋮ Essentials of numerical nonsmooth optimization ⋮ Implementation of a subgradient projection algorithm II

This page was built for publication: A Descent Numerical Method for Optimization Problems with Nondifferentiable Cost Functionals