Nondifferentiable optimization via approximation-Reference-Cited by-同舟云学术

Nondifferentiable optimization via approximation

Published:1975 Issue: Volume: Page:1-25
ISSN:0303-3929
Container-title:Nondifferentiable Optimization
language:
Short-container-title:

Author:

Bertsekas Dimitri P.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0120696.pdf

Reference20 articles.

1. D.P. Bertsekas and S.K. Mitter, “A descent numerical method for optimization problems with nondifferentiable cost functionals,” SIAM Journal on Control 11 (1973) 637–652.

2. D.P. Bertsekas and S.K. Mitter, “Steepest descent for optimization problems with nondifferentiable cost functionals”, Proceedings of the 5th annual Princeton conference on information sciences and systems, Princeton, N.J., March 1971, pp. 347–351.

3. D.P. Bertsekas, “Combined primal-dual and penalty methods for constrained minimization”, SIAM Journal on Control, to appear.

4. D.P. Bertsekas, “On penalty and multiplier methods for constrained minimization”, SIAM Journal on Control 13 (1975) 521–544.

5. RC;J. Cullum,1973

Cited by 72 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A New Smoothing Algorithm to Solve a System of Nonlinear Inequalities;Fundamental Journal of Mathematics and Applications;2023-09-30

2. An exact penalty function approach for inequality constrained optimization problems based on a new smoothing technique;Communications Faculty Of Science University of Ankara Series A1Mathematics and Statistics;2023-04-26

3. A gradient sampling algorithm for stratified maps with applications to topological data analysis;Mathematical Programming;2023-03-04

4. Smoothing Levenberg–Marquardt algorithm for solving non-Lipschitz absolute value equations;Journal of Applied Analysis;2023-01-26

5. Smoothing techniques in solving non-Lipschitz absolute value equations;International Journal of Computer Mathematics;2023-01-03