Journal article
FAC (FAST ADAPTIVE COMPOSITE) ALGORITHMS IN CONVEX-OPTIMIZATION
RAIRO-MATHEMATICAL MODELLING AND NUMERICAL ANALYSIS-MODELISATION MATHEMATIQUE ET ANALYSE NUMERIQUE, Vol.28(1), pp.95-119
01 Jan 1994
Abstract
The goal of this paper is the description and the study of new algorithms of F.A.C. type in a convex optimization background. The F.A.C. method (cf. McCormick [8]) combines multigrid technique with domain decomposition strategy. First we treat the case of optimization without constraint (the proposed algorithm could be considered as an extension of McCormick algorithms in the quadratic case). Secondly, in case of constraints of << obstacle >> type : C = {v is-an-element-of V/v greater-than-or-equal-to c}, the built algorithms are obtained in a similar fashion. For each method, a global convergence theorem is demonstrated under regularity hypotheses on the function to minimize.
Metrics
1 Record Views
Details
- Title
- FAC (FAST ADAPTIVE COMPOSITE) ALGORITHMS IN CONVEX-OPTIMIZATION
- Creators
- R Boyer
- Publication Details
- RAIRO-MATHEMATICAL MODELLING AND NUMERICAL ANALYSIS-MODELISATION MATHEMATIQUE ET ANALYSE NUMERIQUE, Vol.28(1), pp.95-119
- Publisher
- Dunod
- Number of pages
- 25
- Resource Type
- Journal article
- Language
- French
- Academic Unit
- [Retired Faculty]; Mathematics
- Identifiers
- 991020638371404721
UN Sustainable Development Goals (SDGs)
This output has contributed to the advancement of the following goals:
Source: InCites
InCites Highlights
These are selected metrics from InCites Benchmarking & Analytics tool, related to this output
- Web of Science research areas
- Mathematics, Applied