A Descent Numerical Method for Optimization Problems with Nondifferentiable Cost Functionals
DOI10.1137/0311049zbMATH Open0243.49012OpenAlexW2146131395MaRDI QIDQ5654676FDOQ5654676
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
Recommendations
Convex programming (90C25) Methods of successive quadratic programming type (90C55) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Cited In (30)
- Title not available (Why is that?)
- Numerical reduced variable optimization methods via implicit functional dependence with applications
- Application of the subdifferential descent method to a classical nonsmooth variational problem
- Descent methods for composite nondifferentiable optimization problems
- \(\epsilon\)-subgradient method for the solution of nonlinear extremal problems
- An optimal method of constructing an \(\varepsilon\)-subgradient
- Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization
- Essentials of numerical nonsmooth optimization
- Auction algorithms for network flow problems: A tutorial introduction
- Two-direction subgradient method for non-differentiable optimization problems
- Conditional subgradient optimization -- theory and applications
- Implementation of a subgradient projection algorithm
- Implementation of a subgradient projection algorithm II
- An infeasible-point subgradient method using adaptive approximate projections
- Monotone algorithm for seeking saddle point of unsmooth function
- Title not available (Why is that?)
- Theorems of the alternative and duality
- Title not available (Why is that?)
- An introduction to continuous optimization for imaging
- Title not available (Why is that?)
- Approximate optimality conditions and sensitivity analysis in nearly convex optimization
- Using the ?-subgradient method to solve the dual and the primal mathematical programming problems
- Title not available (Why is that?)
- Subdifferentials of functions on sets
- Title not available (Why is that?)
- A subgradient projection algorithm
- Optimization of lipschitz continuous functions
- A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems
- Continuous approximations to generalized jacobians
- Essentials of numerical nonsmooth optimization
This page was built for publication: A Descent Numerical Method for Optimization Problems with Nondifferentiable Cost Functionals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5654676)
