Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
197,910
Robust convex optimization
- Mathematics of Operations Research
, 1998
"... We study convex optimization problems for which the data is not specified exactly and it is only known to belong to a given uncertainty set U, yet the constraints must hold for all possible values of the data from U. The ensuing optimization problem is called robust optimization. In this paper we la ..."
Abstract
-
Cited by 416 (21 self)
- Add to MetaCart
We study convex optimization problems for which the data is not specified exactly and it is only known to belong to a given uncertainty set U, yet the constraints must hold for all possible values of the data from U. The ensuing optimization problem is called robust optimization. In this paper we
Exact Matrix Completion via Convex Optimization
, 2008
"... We consider a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. Suppose that we observe m entries selected uniformly at random from a matrix M. Can we complete the matrix and recover the entries that we have not seen? We show that one can perfe ..."
Abstract
-
Cited by 869 (26 self)
- Add to MetaCart
by solving a simple convex optimization program. This program finds the matrix with minimum nuclear norm that fits the data. The condition above assumes that the rank is not too large. However, if one replaces the 1.2 exponent with 1.25, then the result holds for all values of the rank. Similar results hold
and Convex Optimization
, 2007
"... In this thesis, we analyze state-of-art techniques for analog circuit sizing and compare them on various metrics. We ascertain that a methodology which improves the accuracy of sizing without increasing the run time or the designer effort is a contribution. We argue that the accuracy of geometric pr ..."
Abstract
- Add to MetaCart
accurate posynomial models for MOS transistor parameters, which is the first step of the decomposition. The new algorithm can generate posynomial models with variable number of terms and real-valued exponents. The algorithm is a hybrid of a genetic algorithm and a convex optimization technique. We study
Convex Optimization Algorithms Contents
, 2009
"... This chapter aims to supplement the book Convex Optimization Theory, Athena Scientific, 2009 with material on convex optimization algorithms. ..."
Abstract
- Add to MetaCart
This chapter aims to supplement the book Convex Optimization Theory, Athena Scientific, 2009 with material on convex optimization algorithms.
⋄ Convex Optimization,
"... ... are more than welcome, at any time! Slides will be available on the web: ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
... are more than welcome, at any time! Slides will be available on the web:
Lectures on modern convex optimization
"... Mathematical Programming deals with optimization programs of the form and includes the following general areas: minimize f(x) subject to gi(x) ≤ 0, i = 1,..., m, [x ⊂ R n] 1. Modelling: methodologies for posing various applied problems as optimization programs; 2. Optimization Theory, focusing on e ..."
Abstract
-
Cited by 146 (6 self)
- Add to MetaCart
Mathematical Programming deals with optimization programs of the form and includes the following general areas: minimize f(x) subject to gi(x) ≤ 0, i = 1,..., m, [x ⊂ R n] 1. Modelling: methodologies for posing various applied problems as optimization programs; 2. Optimization Theory, focusing
An introduction to convex optimization for communications and signal processing
- IEEE J. SEL. AREAS COMMUN
, 2006
"... Convex optimization methods are widely used in the ..."
Abstract
-
Cited by 57 (2 self)
- Add to MetaCart
Convex optimization methods are widely used in the
Results 1 - 10
of
197,910
