Results 1  10
of
4,154
Graph implementations for nonsmooth convex programs
 Recent Advances in Learning and Control, Lecture Notes in Control and Information Sciences
, 2008
"... Summary. We describe graph implementations, a generic method for representing a convex function via its epigraph, described in a disciplined convex programming framework. This simple and natural idea allows a very wide variety of smooth and nonsmooth convex programs to be easily specified and effi ..."
Abstract

Cited by 263 (10 self)
 Add to MetaCart
Summary. We describe graph implementations, a generic method for representing a convex function via its epigraph, described in a disciplined convex programming framework. This simple and natural idea allows a very wide variety of smooth and nonsmooth convex programs to be easily specified
Just Relax: Convex Programming Methods for Identifying Sparse Signals in Noise
, 2006
"... This paper studies a difficult and fundamental problem that arises throughout electrical engineering, applied mathematics, and statistics. Suppose that one forms a short linear combination of elementary signals drawn from a large, fixed collection. Given an observation of the linear combination that ..."
Abstract

Cited by 483 (2 self)
 Add to MetaCart
. This paper studies a method called convex relaxation, which attempts to recover the ideal sparse signal by solving a convex program. This approach is powerful because the optimization can be completed in polynomial time with standard scientific software. The paper provides general conditions which ensure
Online Convex Programming and Generalized Infinitesimal Gradient Ascent
, 2003
"... Convex programming involves a convex set F R and a convex function c : F ! R. The goal of convex programming is to nd a point in F which minimizes c. In this paper, we introduce online convex programming. In online convex programming, the convex set is known in advance, but in each step of some ..."
Abstract

Cited by 298 (4 self)
 Add to MetaCart
Convex programming involves a convex set F R and a convex function c : F ! R. The goal of convex programming is to nd a point in F which minimizes c. In this paper, we introduce online convex programming. In online convex programming, the convex set is known in advance, but in each step
Fisher Markets and Convex Programs
"... Convex programming duality is usually stated in its most general form, with convex objective functions and convex constraints. (The book by Boyd and Vandenberghe is an excellent reference [2].) At this ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Convex programming duality is usually stated in its most general form, with convex objective functions and convex constraints. (The book by Boyd and Vandenberghe is an excellent reference [2].) At this
Regularizing the abstract convex program
, 1981
"... Characterizations of optimality for the abstract convex program fi = inf ( p(x) : g(x) E 4, x E R 1, P) where S is an arbitrary convex cone in a finite dimensional space, R is a convex set, and p and g are respectively convex and Sconvex (on a), were given in [lo]. These characterizations hold with ..."
Abstract

Cited by 41 (9 self)
 Add to MetaCart
Characterizations of optimality for the abstract convex program fi = inf ( p(x) : g(x) E 4, x E R 1, P) where S is an arbitrary convex cone in a finite dimensional space, R is a convex set, and p and g are respectively convex and Sconvex (on a), were given in [lo]. These characterizations hold
A globally convergent primaldual interior point algorithm for convex programming
 Mathematical Programming 64
, 1994
"... for convex programming ..."
Exact regularization of convex programs
, 2007
"... The regularization of a convex program is exact if all solutions of the regularized problem are also solutions of the original problem for all values of the regularization parameter below some positive threshold. For a general convex program, we show that the regularization is exact if and only if a ..."
Abstract

Cited by 26 (1 self)
 Add to MetaCart
The regularization of a convex program is exact if all solutions of the regularized problem are also solutions of the original problem for all values of the regularization parameter below some positive threshold. For a general convex program, we show that the regularization is exact if and only
Method of Reduction in Convex Programming
, 1983
"... We present an algorithm which solves a convex program with faithfully convex (not necessarily differentiable) constraints. While finding a feasible starting point, the algorithm reduces the program to an equivalent program for which Slater's condition is satisfied. Included are algorithms for ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
We present an algorithm which solves a convex program with faithfully convex (not necessarily differentiable) constraints. While finding a feasible starting point, the algorithm reduces the program to an equivalent program for which Slater's condition is satisfied. Included are algorithms
Posture recognition with convex programming
"... We present a novel human posture recognition method us ing convex programming based matching schemes. Instead of trying to segment the object from the background, we develop a novel multistage linear programming scheme to locate the target by searching for the best matching region based on an automa ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We present a novel human posture recognition method us ing convex programming based matching schemes. Instead of trying to segment the object from the background, we develop a novel multistage linear programming scheme to locate the target by searching for the best matching region based
On Conically Ordered Convex Programs
, 2003
"... In this paper we study a special class of convex optimization problems called conically ordered convex programs (COCP), where the feasible region is given as the level set of a vectorvalued nonlinear mapping, expressed as a nonnegative combination of convex functions. The nonnegativity of the vect ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
In this paper we study a special class of convex optimization problems called conically ordered convex programs (COCP), where the feasible region is given as the level set of a vectorvalued nonlinear mapping, expressed as a nonnegative combination of convex functions. The nonnegativity
Results 1  10
of
4,154