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
2010
Highly Cited
2010
Delay-dependent criteria for absolute stability of uncertain time-delayed Lur'e dynamical systems
Highly Cited
2009
Highly Cited
2009
Cross-Layer Scheduling for OFDMA Amplify-and-Forward Relay Networks
In this paper, we consider cross-layer scheduling for the downlink of amplify-and-forward (AF) relay-assisted orthogonal… 
Highly Cited
2008
Highly Cited
2008
Design of state estimator for neural networks of neutral-type
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
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… 
Highly Cited
2004
Highly Cited
2004
Energy-Constrained Optimal Quantization for Wireless Sensor Networks
As low power, low cost, and longevity of transceivers are major requirements in wireless sensor networks, optimizing their design… 
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… 
1976
1976
An approach to on-line power dispatch with ambient air pollution constraints
An on-line optimal environmental/economic dispatch methodology for electric power generation is developed in this paper. Aside… 
Highly Cited
1966
Highly Cited
1966
Linear and Convex Programming
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)