Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2012

Highly Cited

2012

Suppose that one observes an incomplete subset of entries selected from a low-rank matrix. When is it possible to complete the… Expand

Highly Cited

2009

Highly Cited

2009

We consider a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. Suppose… Expand

Highly Cited

2009

Highly Cited

2009

We consider the problem of choosing a set of k sensor measurements, from a set of m possible or potential sensor measurements… Expand

Highly Cited

2007

Highly Cited

2007

Abstract
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of… Expand

Highly Cited

2006

Highly Cited

2006

Convex optimization problems arise frequently in many different fields. A comprehensive introduction to the subject, this book… Expand

Highly Cited

2004

Highly Cited

2004

It was in the middle of the 1980s, when the seminal paper by Kar markar opened a new epoch in nonlinear optimization. The… Expand

Highly Cited

2004

Highly Cited

2004

Optimization is the science of making a best choice in the face of conflicting requirements. Any convex optimization problem has… Expand

Review

2001

Review

2001

This is a book devoted to well-structured and thus efficiently solvable convex optimization problems, with emphasis on conic… Expand

Highly Cited

1998

Highly Cited

1998

We study convex optimization problems for which the data is not specified exactly and it is only known to belong to a given… Expand

Highly Cited

1987

Highly Cited

1987

Sun, 06 Jan 2019 10:24:00 GMT lectures on modern convex optimization pdf Convex optimization problems arise frequently in many… Expand