Decomposition schemes for finding saddle points of quasi-convex-concave functions
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
Mannheimer Manuskripte ; 077
- Keyword
-
Dekomposition ; Sattelpunktmethode
- Event
-
Veröffentlichung
- (where)
-
Mannheim
- (who)
-
Universitätsbibliothek Mannheim
- (when)
-
1987
- Creator
-
Oettli, Werner
- URN
-
urn:nbn:de:bsz:180-madoc-19651
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:44 PM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Oettli, Werner
- Universitätsbibliothek Mannheim
Time of origin
- 1987
Other Objects (12)
Convex fuzzy games and participation monotonic allocation schemes
Saddle Por Bitchez
Monolithic Overlapping Schwarz Domain Decomposition Methods with GDSW Coarse Spaces for Saddle Point Problems
The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
A plane sweep algorithm for finding a closest pair among convex planar objects
Convergence of Alternating Domain Decomposition Schemes for Kinetic and Aerodynamic Equations
convex
Convex
Self-concordant Tree and Decomposition Based Interior Point Methods for Stochastic Convex Optimization Problem
Decomposition-based interior point methods for two-stage stochastic convex quadratic programs with recourse
Saddle point localization of molecular wavefunctions
Multigrid smoothers for saddle point systems
Convex fuzzy games and participation monotonic allocation schemes
Saddle Por Bitchez
Monolithic Overlapping Schwarz Domain Decomposition Methods with GDSW Coarse Spaces for Saddle Point Problems
The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
A plane sweep algorithm for finding a closest pair among convex planar objects
Convergence of Alternating Domain Decomposition Schemes for Kinetic and Aerodynamic Equations
convex
Convex
Self-concordant Tree and Decomposition Based Interior Point Methods for Stochastic Convex Optimization Problem
Decomposition-based interior point methods for two-stage stochastic convex quadratic programs with recourse
Saddle point localization of molecular wavefunctions
Multigrid smoothers for saddle point systems
Convex fuzzy games and participation monotonic allocation schemes
Saddle Por Bitchez
Monolithic Overlapping Schwarz Domain Decomposition Methods with GDSW Coarse Spaces for Saddle Point Problems
The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
A plane sweep algorithm for finding a closest pair among convex planar objects
Convergence of Alternating Domain Decomposition Schemes for Kinetic and Aerodynamic Equations
convex
Convex
Self-concordant Tree and Decomposition Based Interior Point Methods for Stochastic Convex Optimization Problem
Decomposition-based interior point methods for two-stage stochastic convex quadratic programs with recourse
Saddle point localization of molecular wavefunctions