Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
A Primal–Dual Splitting Method for Convex Optimization Involving Lipschitzian, Proximable and Linear Composite Terms
by
Condat, Laurent
in
Algorithms
/ Applications of Mathematics
/ Calculus of Variations and Optimal Control; Optimization
/ Composite functions
/ Convex analysis
/ Engineering
/ Engineering Sciences
/ Formulations
/ Game theory
/ Inversions
/ Linear operators
/ Mathematics
/ Mathematics and Statistics
/ Methods
/ Operations Research/Decision Theory
/ Operators
/ Optimization
/ Optimization and Control
/ Signal and Image processing
/ Splitting
/ Studies
/ Theory of Computation
2013
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
A Primal–Dual Splitting Method for Convex Optimization Involving Lipschitzian, Proximable and Linear Composite Terms
by
Condat, Laurent
in
Algorithms
/ Applications of Mathematics
/ Calculus of Variations and Optimal Control; Optimization
/ Composite functions
/ Convex analysis
/ Engineering
/ Engineering Sciences
/ Formulations
/ Game theory
/ Inversions
/ Linear operators
/ Mathematics
/ Mathematics and Statistics
/ Methods
/ Operations Research/Decision Theory
/ Operators
/ Optimization
/ Optimization and Control
/ Signal and Image processing
/ Splitting
/ Studies
/ Theory of Computation
2013
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
A Primal–Dual Splitting Method for Convex Optimization Involving Lipschitzian, Proximable and Linear Composite Terms
by
Condat, Laurent
in
Algorithms
/ Applications of Mathematics
/ Calculus of Variations and Optimal Control; Optimization
/ Composite functions
/ Convex analysis
/ Engineering
/ Engineering Sciences
/ Formulations
/ Game theory
/ Inversions
/ Linear operators
/ Mathematics
/ Mathematics and Statistics
/ Methods
/ Operations Research/Decision Theory
/ Operators
/ Optimization
/ Optimization and Control
/ Signal and Image processing
/ Splitting
/ Studies
/ Theory of Computation
2013
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
A Primal–Dual Splitting Method for Convex Optimization Involving Lipschitzian, Proximable and Linear Composite Terms
Journal Article
A Primal–Dual Splitting Method for Convex Optimization Involving Lipschitzian, Proximable and Linear Composite Terms
2013
Request Book From Autostore
and Choose the Collection Method
Overview
We propose a new first-order splitting algorithm for solving jointly the primal and dual formulations of large-scale convex minimization problems involving the sum of a smooth function with Lipschitzian gradient, a nonsmooth proximable function, and linear composite functions. This is a full splitting approach, in the sense that the gradient and the linear operators involved are applied explicitly without any inversion, while the nonsmooth functions are processed individually via their proximity operators. This work brings together and notably extends several classical splitting schemes, like the forward–backward and Douglas–Rachford methods, as well as the recent primal–dual method of Chambolle and Pock designed for problems with linear composite terms.
Publisher
Springer US,Springer Nature B.V,Springer Verlag
MBRLCatalogueRelatedBooks
Related Items
Related Items
This website uses cookies to ensure you get the best experience on our website.