The Proximal Alternating Minimization Algorithm for Two-Block Separable Convex Optimization Problems with Linear Constraints
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1573-2878
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
The Proximal Alternating Minimization Algorithm for Two-Block Separable Convex Optimization Problems with Linear Constraints ; day:24 ; month:12 ; year:2018 ; pages:1-23
Journal of optimization theory and applications ; (24.12.2018), 1-23
- Creator
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s10957-018-01454-y
- URN
-
urn:nbn:de:101:1-2019020611431193149232
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
- 14.08.2025, 10:55 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
- Bitterlich, Sandy
- Boţ, Radu Ioan
- Csetnek, Ernö Robert
- Wanka, Gert
- SpringerLink (Online service)
Other Objects (12)
Inertial proximal alternating minimization for nonconvex and nonsmooth problems
A primal-dual fixed point algorithm for minimization of the sum of three convex separable functions
A symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programming
On the global and linear convergence of direct extension of ADMM for 3-block separable convex minimization models
Extragradient method for convex minimization problem
Convex minimization and phase field models
Network manipulation algorithm based on inexact alternating minimization
On the rate of convergence of alternating minimization for non-smooth non-strongly convex optimization in Banach spaces
Discrete Fenchel duality for a pair of integrally convex and separable convex functions
Convex analysis and minimization algorithms, 1.. Fundamentals
Dynamical approaches to linearly constrained convex minimization
Convex analysis and minimization algorithms, 1.. Fundamentals
Inertial proximal alternating minimization for nonconvex and nonsmooth problems
A primal-dual fixed point algorithm for minimization of the sum of three convex separable functions
A symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programming
On the global and linear convergence of direct extension of ADMM for 3-block separable convex minimization models
Extragradient method for convex minimization problem
Convex minimization and phase field models
Network manipulation algorithm based on inexact alternating minimization
On the rate of convergence of alternating minimization for non-smooth non-strongly convex optimization in Banach spaces
Discrete Fenchel duality for a pair of integrally convex and separable convex functions
Convex analysis and minimization algorithms, 1.. Fundamentals
Dynamical approaches to linearly constrained convex minimization
Convex analysis and minimization algorithms, 1.. Fundamentals
Inertial proximal alternating minimization for nonconvex and nonsmooth problems
A primal-dual fixed point algorithm for minimization of the sum of three convex separable functions
A symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programming
On the global and linear convergence of direct extension of ADMM for 3-block separable convex minimization models
Extragradient method for convex minimization problem
Convex minimization and phase field models
Network manipulation algorithm based on inexact alternating minimization
On the rate of convergence of alternating minimization for non-smooth non-strongly convex optimization in Banach spaces
Discrete Fenchel duality for a pair of integrally convex and separable convex functions
Convex analysis and minimization algorithms, 1.. Fundamentals
Dynamical approaches to linearly constrained convex minimization