A Polynomial-Time Descent Method for Separable Convex Optimization Problems with Linear Constraints

Published 2016 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
A Polynomial-Time Descent Method for Separable Convex Optimization Problems with Linear Constraints
Authors
Keywords
-
Journal
SIAM JOURNAL ON OPTIMIZATION
Volume 26, Issue 1, Pages 856-889
Publisher
Society for Industrial & Applied Mathematics (SIAM)
Online
2016-04-01
DOI
10.1137/14098524x

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Publish scientific posters with Peeref

Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.

Learn More

Find the ideal target journal for your manuscript

Explore over 38,000 international journals covering a vast array of academic fields.

Search
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.