Composition and union of general algorithms of optimization

DOI10.1007/BFB0120844MaRDI QIDQ4189063zbMATH OpenOpenAlexFDO

Authors P. Huard, J. C. 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

Composition of FunctionsConvergenceFixed PointsFree-Steering AlgorithmsNonlinear ProgrammingRelaxation AlgorithmsSet-Valued MapsUnion of Algorithms

Mathematics Subject Classification ID

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

Cited in

(11)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4189063)