- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-5217
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
On a conjugate directions method for solving strictly convex QP problem ; volume:86 ; number:3 ; day:15 ; month:9 ; year:2017 ; pages:523-548 ; date:12.2017
Mathematical methods of operations research ; 86, Heft 3 (15.9.2017), 523-548, 12.2017
- Classification
-
Mathematik
- Creator
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00186-017-0607-z
- URN
-
urn:nbn:de:1111-201803218272
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:52 AM CEST
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
- Stachurski, Andrzej
- SpringerLink (Online service)
Other Objects (12)
ON STRICTLY POSITIVE MEASURES AND STRICTLY CONVEX NORMS
Minimum Strictly Convex Quadrangulations of Convex Polygons
Conjugate duality in convex optimization
Conjugate duality in convex optimization
ON STRICTLY n-CONVEX NORMED LINEAR SPACES
A strictly feasible sequential convex programming method
The conjugate locus on convex surfaces
On strong orthogonality and strictly convex normed linear spaces
Line search fixed point algorithms based on nonlinear conjugate gradient directions: application to constrained smooth convex optimization
Regularized step directions in nonlinear conjugate gradient methods
Radon Inversion Problem for Holomorphic Functions on Circular, Strictly Convex Domains
ON THE PRINCIPLE OF UNIFORM BOUNDEDNESS FOR LSC CONVEX PROCESSES IN A STRICTLY N LOCALLY CONVEX SPACES
ON STRICTLY POSITIVE MEASURES AND STRICTLY CONVEX NORMS
Minimum Strictly Convex Quadrangulations of Convex Polygons
Conjugate duality in convex optimization
Conjugate duality in convex optimization
ON STRICTLY n-CONVEX NORMED LINEAR SPACES
A strictly feasible sequential convex programming method
The conjugate locus on convex surfaces
On strong orthogonality and strictly convex normed linear spaces
Line search fixed point algorithms based on nonlinear conjugate gradient directions: application to constrained smooth convex optimization
Regularized step directions in nonlinear conjugate gradient methods
Radon Inversion Problem for Holomorphic Functions on Circular, Strictly Convex Domains
ON THE PRINCIPLE OF UNIFORM BOUNDEDNESS FOR LSC CONVEX PROCESSES IN A STRICTLY N LOCALLY CONVEX SPACES
ON STRICTLY POSITIVE MEASURES AND STRICTLY CONVEX NORMS
Minimum Strictly Convex Quadrangulations of Convex Polygons
Conjugate duality in convex optimization
Conjugate duality in convex optimization
ON STRICTLY n-CONVEX NORMED LINEAR SPACES
A strictly feasible sequential convex programming method
The conjugate locus on convex surfaces
On strong orthogonality and strictly convex normed linear spaces
Line search fixed point algorithms based on nonlinear conjugate gradient directions: application to constrained smooth convex optimization
Regularized step directions in nonlinear conjugate gradient methods
Radon Inversion Problem for Holomorphic Functions on Circular, Strictly Convex Domains