Skip to search formSkip to main contentSkip to account menu

Convex optimization

Known as: Convex programming, Convex optimization problem, Convex problem 
Convex minimization, a subfield of optimization, studies the problem of minimizing convex functions over convex sets. The convexity property can make… 
Wikipedia (opens in a new tab)

Related topics

Related topics

48 relations
BackpropagationBarrier functionBregman methodCharacteristic function (convex analysis)

Broader (1)

Convex analysis

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
Accelerated Methods for Non-Convex Optimization
We present an accelerated gradient method for nonconvex optimization problems with Lipschitz continuous first and second… 
Highly Cited
2015
Highly Cited
2015
A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization
In this paper we improve upon the running time for finding a point in a convex set given a separation oracle. In particular… 
Highly Cited
2014
Highly Cited
2014
Footstep planning on uneven terrain with mixed-integer convex optimization
We present a new method for planning footstep placements for a robot walking on uneven terrain with obstacles, using a mixed… 
Highly Cited
2013
Highly Cited
2013
Group-Sparse Signal Denoising: Non-Convex Regularization, Convex Optimization
Convex optimization with sparsity-promoting convex regularization is a standard approach for estimating sparse signals in noise… 
Highly Cited
2011
Highly Cited
2011
Distributed Subgradient Methods for Convex Optimization Over Random Networks
We consider the problem of cooperatively minimizing the sum of convex functions, where the functions represent local objective… 
Review
2010
Review
2010
Convex Optimization-Based Beamforming
In this article, an overview of advanced convex optimization approaches to multisensor beamforming is presented, and connections… 
Highly Cited
2010
Highly Cited
2010
Latent variable graphical model selection via convex optimization
Suppose we have samples of a subset of a collection of random variables. No additional information is provided about the number… 
Highly Cited
2010
Highly Cited
2010
Design of Affine Controllers via Convex Optimization
We consider a discrete-time time-varying linear dynamical system, perturbed by process noise, with linear noise corrupted… 
Highly Cited
2009
Highly Cited
2009
Cutting-set methods for robust convex optimization with pessimizing oracles
We consider a general worst-case robust convex optimization problem, with arbitrary dependence on the uncertain parameters, which… 
Highly Cited
2008
Highly Cited
2008
Incremental Stochastic Subgradient Algorithms for Convex Optimization
This paper studies the effect of stochastic errors on two constrained incremental subgradient algorithms. The incremental… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)