Skip to search formSkip to main contentSkip to account menu

Constrained optimization

Known as: Soft constraint, Hard constraint, Constraint optimization 
In mathematical optimization, constrained optimization (in some contexts called constraint optimization) is the process of optimizing an objective… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
We present distributed algorithms that can be used by multiple agents to align their estimates with a particular value over a… 
Highly Cited
2007
Highly Cited
2007
This paper presents the comparison results on the performance of the Artificial Bee Colony (ABC) algorithm for constrained… 
Highly Cited
2006
Highly Cited
2006
This paper addresses the problem of minimization of a nonsmooth function under general nonsmooth constraints when no derivatives… 
Highly Cited
2002
Highly Cited
2002
Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with… 
Highly Cited
2000
Highly Cited
2000
Penalty functions are often used in constrained optimization. However, it is very difficult to strike the right balance between… 
Highly Cited
1997
Highly Cited
1997
L-BFGS-B is a limited-memory algorithm for solving large nonlinear optimization problems subject to simple bounds on the… 
Highly Cited
1995
Highly Cited
1995
An algorithm for solving large nonlinear optimization problems with simple bounds is described. It is based on the gradient… 
Highly Cited
1994
Highly Cited
1994
This paper presents an application of genetic algorithms (GAs) to nonlinear constrained optimization. GAs are general purpose… 
Highly Cited
1977
Highly Cited
1977
We introduce semismooth and semiconvex functions and discuss their properties with respect to nonsmooth nonconvex constrained… 
Highly Cited
1965
Highly Cited
1965
A new method for finding the maximum of a general non-linear function of several variables within a constrained region is…