Optimization algorithms and point-to-set-maps
Mathematical ProgrammingPublished 1 December 1975
Pierre Huard
Citations31
SJR quartileQ1
SJR score1.73
SNIP2.20
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
Two general nonlinear optimization algorithms generating a sequence of feasible solutions based on the concept of point-to-set mapping continuity are described and the results unify these apparently diverse approaches.
Abstract
Two general nonlinear optimization algorithms generating a sequence of feasible solutions are described. The justifications for their convergence are based on the concept of point-to-set mapping continuity. These two algorithms cover many conventional feasible solution methods. The convergence results unify these apparently diverse approaches.
Keywords
Social SciencesEngineeringComputer Science
Journal of the Society for Industrial and Applied MathematicsThe Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
1,178 Citations1960J. B. Rosen
In this, Part I of the paper, it is shown how the gradient projection method is shown to solve the problem of nonlinear constraints and equations, with either a linear or nonlinear objective function.
Methods of Feasible Directions
541 Citations2005Mokhtar S. Bazaraa, Hanif D. Sherali +1 more
SIAM Journal on ControlIterative Solution of Nonlinear Optimal Control Problems
126 Citations1966J. B. Rosen
The solution of nonlinear, state-constrained, discrete optimal control problems by mathematical programming methods is described and global convergence of the iterative method is demonstrated provided a convexity and constraint set condition are both satisfied.
SIAM Journal on ControlThe Validity of a Family of Optimization Methods
114 Citations1970Robert H. Meyer
A family of iterative optimization methods, which includes most of the well-known algorithms of mathematical programming, is described and analyzed with respect to the properties of its accumulation points and it is shown that these accumulation points have desirable properties under appropriate assumptions on a relevant point-to-set mapping.
Revue française d informatique et de recherche opérationnelleProgrammation mathématique convexe
38 Citations1968Pierre Huard
L’accès aux archives de la revue « Revue française d’informatique and de recherche opérationnelle, série rouge » implique l’ Accord avec les conditions générales d“utilisation”.
Elsevier eBooksA Method of Centers by Upper-Bounding Functions with Applications
18 Citations1970Pierre Huard
A very general procedure is developed by using an upper-bound of the F-distance to converge the method of centers with approximate centres, if the corresponding errors tend to zero.
Elsevier eBooksOn the Implementation of Conceptual Algorithms
10 Citations1970E. Polak
This work discusses general and highly efficient procedures for implementing conceptual algorithms, i.e, for transforming them into an algorithm with iterations requiring only a finite number of function evaluations and arithmetical operations.