ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
59
views
0
references
Top references
cited by
323
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,217
similar
All similar
Record
: found
Abstract
: not found
Book
: not found
Interior-Point Polynomial Algorithms in Convex Programming
monograph
Author(s):
Yurii Nesterov
,
Arkadii Nemirovskii
Publication date
(Online):
May 25 2012
Publisher:
Society for Industrial and Applied Mathematics
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Smart Contracts Programming Languages
Author and book information
Book
ISBN (Print):
978-0-89871-319-0
ISBN (Electronic):
978-1-61197-079-1
Publication date (Print):
January 1994
Publication date (Online):
May 25 2012
DOI:
10.1137/1.9781611970791
SO-VID:
ce0bf30e-4cd2-49c0-b54e-7654d3eed759
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
1. Introduction
pp. 11
2. Self-Concordant Functions and Newton Method
pp. 57
3. Path-Following Interior-Point Methods
pp. 101
4. Potential Reduction Interior-Point Methods
pp. 147
5. How to Construct Self-Concordant Barriers
pp. 217
6. Applications in Convex Optimization
pp. 273
7. Variational Inequalities with Monotone Operators
pp. 315
8. Acceleration for Linear and Linearly Constrained Quadratic Problems
Similar content
2,217
Retracted: Dynamic Harmony Search with Polynomial Mutation Algorithm for Valve-Point Economic Load Dispatch
Authors:
The Scientific World Journal
Projections onto Convex Sets Super-Resolution Reconstruction Based on Point Spread Function Estimation of Low-Resolution Remote Sensing Images
Authors:
Chong-Xu Fan
,
Chaoyun Wu
,
Grand Li
…
A polynomial-time algorithm for user-based relocation in free-floating car sharing systems
Authors:
Maximilian Schiffer
,
Gerhard Hiermann
,
Fabian Rüdel
…
See all similar
Cited by
321
Domain adaptation via transfer component analysis.
Authors:
Sinno Jialin Pan
,
Ivor Tsang
,
James Kwok
…
Robust Convex Optimization
Authors:
A. Ben-Tal
,
A. Nemirovski
An approach to fuzzy control of nonlinear systems: stability and design issues
Authors:
M.F. Griffin
,
H.O. Wang
,
K Tanaka
See all cited by