Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Algorithmes de type F.A.C. en optimisation convexe

From MaRDI portal
Publication:4698894
Jump to:navigation, search

DOI10.1051/m2an/1994280100951zbMath0822.65043OpenAlexW2498746327MaRDI QIDQ4698894

No author found.

Publication date: 12 June 1995

Published in: ESAIM: Mathematical Modelling and Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/193732


zbMATH Keywords

global convergenceconvex optimizationfinite element methoddomain decompositionmultigrid methodfast adaptive composite grid method


Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Newton-type methods (49M15) Existence theories for problems in abstract spaces (49J27) Mathematical programming (90C99)




Cites Work

  • A multilevel iterative method for symmetric, positive definite linear complementarity problems
  • Multigrid methods II. Proceedings of the 2nd European Conference on Multigrid Methods held at Cologne (Federal Republic of Germany), October 1-4, 1985
  • The Fast Adaptive Composite Grid (FAC) Method for Elliptic Equations
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item


This page was built for publication: Algorithmes de type F.A.C. en optimisation convexe

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4698894&oldid=18938112"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 7 February 2024, at 20:50.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki