Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
We present distributed algorithms that can be used by multiple agents to align their estimates with a particular value over a… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2007
Highly Cited
2007
This paper presents the comparison results on the performance of the Artificial Bee Colony (ABC) algorithm for constrained… Expand
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
2006
Highly Cited
2006
This paper addresses the problem of minimization of a nonsmooth function under general nonsmooth constraints when no derivatives… Expand
  • figure 2.1
  • figure 4.1
  • figure 5.1
  • figure 5.2
  • figure 5.3
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with… Expand
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with… Expand
  • table 1.1
  • table 1.2
Is this relevant?
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… Expand
  • figure 1
  • table I
  • table II
  • table III
  • table IV
Is this relevant?
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… Expand
  • table I
  • table II
  • table III
  • table IV
Is this relevant?
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… Expand
Is this relevant?
Highly Cited
1994
Highly Cited
1994
This paper presents an application of genetic algorithms (GAs) to nonlinear constrained optimization. GAs are general purpose… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 4
Is this relevant?
Highly Cited
1977
Highly Cited
1977
We introduce semismooth and semiconvex functions and discuss their properties with respect to nonsmooth nonconvex constrained… Expand
Is this relevant?