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
2010
Highly Cited
2010
A discrete firefly metaheuristic with local search for makespan minimization in permutation flow shop scheduling problems
Article history: Received 23 January 2010 Received in revised form 23 April 2010 Accepted 26 April 2010 Available online 26 April… 
Highly Cited
2009
Highly Cited
2009
Exponential stability analysis for uncertain neural networks with interval time-varying delays
Highly Cited
2008
Highly Cited
2008
Caging Polygons with Two and Three Fingers
We study two- and three-finger caging grasps of a given polygonal object with n edges. A grasp is said to cage an object when it… 
Highly Cited
2007
Highly Cited
2007
Tradeoff Between Lifetime and Rate Allocation in Wireless Sensor Networks: A Cross Layer Approach
This paper studies the tradeoff between energy consumption and application performance in wireless sensor networks by… 
Highly Cited
2007
Highly Cited
2007
A delay-dependent asymptotic stability criterion of cellular neural networks with time-varying discrete and distributed delays
Highly Cited
2007
Highly Cited
2007
Effective digital implementation of fuzzy control systems based on approximate discrete-time models
Highly Cited
2006
Highly Cited
2006
Queue proportional scheduling via geometric programming in fading broadcast channels
For fading broadcast channels (BC), a throughput optimal scheduling policy called queue proportional scheduling (QPS) is… 
1989
1989
The Projective SUMT Method for Convex Programming
An algorithm for solving convex programming problems is derived from the differential equation characterizing the trajectory of… 
Highly Cited
1966
Highly Cited
1966
Linear and Convex Programming
Highly Cited
1966
Highly Cited
1966
Programming Under Uncertainty: The Solution Set
Abstract : In a previous paper (AD-612 896), the author described and characterized the equivalent convex program of a twostage… 
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)