Composition and union of general algorithms of optimization

DOI10.1007/BFB0120844zbMATH Open0403.90072OpenAlexW107926461MaRDI QIDQ4189063FDOQ4189063

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

ConvergenceFixed PointsNonlinear ProgrammingSet-Valued MapsComposition of FunctionsFree-Steering AlgorithmsRelaxation AlgorithmsUnion of Algorithms

Mathematics Subject Classification ID

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

Cited In (10)

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

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)