Composition and union of general algorithms of optimization

DOI10.1007/BFb0120844zbMath0403.90072OpenAlexW107926461MaRDI QIDQ4189063

P. Huard, Jean-Charles Fiorot

Publication date: 1979

Published in: Mathematical Programming Studies (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0120844

zbMATH Keywords

ConvergenceNonlinear ProgrammingFixed PointsSet-Valued MapsComposition of FunctionsFree-Steering AlgorithmsRelaxation AlgorithmsUnion of Algorithms

Mathematics Subject Classification ID

Nonlinear programming (90C30) Rate of convergence, degree of approximation (41A25)

Related Items (10)

Convergence of relaxation algorithms by averaging ⋮ On a numerical construction of doubly stochastic matrices with prescribed eigenvalues ⋮ Duality theory in interval-valued linear programming problems ⋮ Alternating projection method for sparse model updating problems ⋮ Duality theory for optimization problems with interval-valued objective functions ⋮ An homage to Joseph-Louis Lagrange and Pierre Huard ⋮ Duality theory in fuzzy optimization problems ⋮ Convergence properties of relaxation algorithms ⋮ Algorithmes pour suites non convergentes ⋮ Extended convergence results for the method of multipliers for nonstrictly binding inequality constraints

This page was built for publication: Composition and union of general algorithms of optimization