Line search fixed point algorithms based on nonlinear conjugate gradient directions: application to constrained smooth convex optimization
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1687-1812
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Line search fixed point algorithms based on nonlinear conjugate gradient directions: application to constrained smooth convex optimization ; volume:2016 ; number:1 ; day:8 ; month:7 ; year:2016 ; pages:1-32 ; date:12.2016
Fixed point theory and applications ; 2016, Heft 1 (8.7.2016), 1-32, 12.2016
- Urheber
-
Iiduka, Hideaki
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1186/s13663-016-0567-7
- URN
-
urn:nbn:de:1111-2016071122164
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:53 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Iiduka, Hideaki
- SpringerLink (Online service)
Ähnliche Objekte (12)
On a conjugate directions method for solving strictly convex QP problem
A stochastic moving ball approximation method for smooth convex constrained minimization
Conjugate duality in convex optimization
Conjugate duality in convex optimization
The conjugate locus on convex surfaces
Smooth valuations on convex functions
Gradient-type penalty method with inertial effects for solving constrained convex optimization problems with smooth data
Regularized step directions in nonlinear conjugate gradient methods
Convex optimization for inequality constrained adjustment problems
Dynamical approaches to linearly constrained convex minimization
On two-stage convex chance constrained problems
Convex Optimization for Inequality Constrained Adjustment Problems
On a conjugate directions method for solving strictly convex QP problem
A stochastic moving ball approximation method for smooth convex constrained minimization
Conjugate duality in convex optimization
Conjugate duality in convex optimization
The conjugate locus on convex surfaces
Smooth valuations on convex functions
Gradient-type penalty method with inertial effects for solving constrained convex optimization problems with smooth data
Regularized step directions in nonlinear conjugate gradient methods
Convex optimization for inequality constrained adjustment problems
Dynamical approaches to linearly constrained convex minimization
On two-stage convex chance constrained problems
Convex Optimization for Inequality Constrained Adjustment Problems
On a conjugate directions method for solving strictly convex QP problem
A stochastic moving ball approximation method for smooth convex constrained minimization
Conjugate duality in convex optimization
Conjugate duality in convex optimization
The conjugate locus on convex surfaces
Smooth valuations on convex functions
Gradient-type penalty method with inertial effects for solving constrained convex optimization problems with smooth data
Regularized step directions in nonlinear conjugate gradient methods
Convex optimization for inequality constrained adjustment problems
Dynamical approaches to linearly constrained convex minimization
On two-stage convex chance constrained problems