Méthodes du second ordre dans les problèmes d'optimisation avec contraintes
R.I.R.O., 3 R2 (1969) 27-42
Published online: 2017-02-01
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Global Convergence and Acceleration of Projection Methods for Feasibility Problems Involving Union Convex Sets
Jan Harold Alcantara and Ching-pei LeeJournal of Optimization Theory and Applications 204 (2) (2025)
https://doi.org/10.1007/s10957-024-02580-6
On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
Yair Censor, Wei Chen, Patrick L. Combettes, Ran Davidi and Gabor T. HermanComputational Optimization and Applications 51 (3) 1065 (2012)
https://doi.org/10.1007/s10589-011-9401-7
Local Linear Convergence for Alternating and Averaged Nonconvex Projections
A. S. Lewis, D. R. Luke and J. MalickFoundations of Computational Mathematics 9 (4) 485 (2009)
https://doi.org/10.1007/s10208-008-9036-y
Extrapolation algorithm for affine-convex feasibility problems
Heinz H. Bauschke, Patrick L. Combettes and Serge G. KrukNumerical Algorithms 41 (3) 239 (2006)
https://doi.org/10.1007/s11075-005-9010-6
The asymptotic behavior of the composition of two resolvents
Heinz H. Bauschke, Patrick L. Combettes and Simeon ReichNonlinear Analysis: Theory, Methods & Applications 60 (2) 283 (2005)
https://doi.org/10.1016/j.na.2004.07.054
Partial inverse of a monotone operator
Jonathan E. SpingarnApplied Mathematics & Optimization 10 (1) 247 (1983)
https://doi.org/10.1007/BF01448388
Global convergence for Newton methods in mathematical programming
J. W. DanielJournal of Optimization Theory and Applications 12 (3) 233 (1973)
https://doi.org/10.1007/BF00935105
Tour d'horizon : programmation non linéaire
P. HuardRevue française d'informatique et de recherche opérationnelle. Série rouge 5 (R1) 3 (1971)
https://doi.org/10.1051/m2an/197105R100031
Penalty function versus non-penalty function methods for constrained nonlinear programming problems
Garth P. McCormickMathematical Programming 1 (1) 217 (1971)
https://doi.org/10.1007/BF01584087
Problems and methods with multiple objective functions
B. RoyMathematical Programming 1 (1) 239 (1971)
https://doi.org/10.1007/BF01584088
Symposium on Optimization
A. AuslenderLecture Notes in Mathematics, Symposium on Optimization 132 37 (1970)
https://doi.org/10.1007/BFb0066671