Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 221,085,652 papers from all fields of science
Search
Sign In
Create Free Account
Constrained optimization
Known as:
Soft constraint
, Hard constraint
, Constraint optimization
Expand
In mathematical optimization, constrained optimization (in some contexts called constraint optimization) is the process of optimizing an objective…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
34 relations
ABS methods
BOBYQA
Black–Litterman model
Branch and bound
Expand
Broader (1)
Constraint programming
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Chaotic differential evolution methods for dynamic economic dispatch with valve-point effects
Youlin Lu
,
Jian-zhong Zhou
,
Hui Qin
,
Y. Wang
,
Yongchuan Zhang
Engineering applications of artificial…
2011
Corpus ID: 44282771
Highly Cited
2010
Highly Cited
2010
A geometric approach to improve spectrum efficiency for cognitive relay networks
Min Xie
,
Wei Zhang
,
Kai‐Kit Wong
IEEE Transactions on Wireless Communications
2010
Corpus ID: 6939637
Cognitive radio (CR) enables dynamic spectrum access (DSA). In CR networks (CRNs), unlicensed cognitive users (CUs) can share the…
Expand
Highly Cited
2009
Highly Cited
2009
Existence of solutions for variational inequalities on Riemannian manifolds
Shu-Long Li
,
Chong Li
,
Y. Liou
,
J. Yao
2009
Corpus ID: 1618924
Highly Cited
2006
Highly Cited
2006
ASSET ALLOCATION AND ANNUITY‐PURCHASE STRATEGIES TO MINIMIZE THE PROBABILITY OF FINANCIAL RUIN
M. Milevsky
,
K. Moore
,
V. Young
2006
Corpus ID: 14288728
In this paper, we derive the optimal investment and annuitization strategies for a retiree whose objective is to minimize the…
Expand
Highly Cited
2005
Highly Cited
2005
Using cooperative mediation to coordinate traffic lights: a case study
Denise de Oliveira
,
A. Bazzan
,
V. Lesser
Adaptive Agents and Multi-Agent Systems
2005
Corpus ID: 2158823
Several approaches tackle the problem of reducing traffic jams. A class of these approaches deals with coordination of traffic…
Expand
Highly Cited
2005
Highly Cited
2005
Optimal adaptation decision-taking for terminal and network quality-of-service
D. Mukherjee
,
E. Delfosse
,
Jae-Gon Kim
,
Yong Wang
IEEE transactions on multimedia
2005
Corpus ID: 17785816
In order to cater to the diversity of terminals and networks, efficient, and flexible adaptation of multimedia content in the…
Expand
Highly Cited
2003
Highly Cited
2003
Incorporating Illumination Constraints in Deformable Models for Shape from Shading and Light Direction Estimation
D. Samaras
,
Dimitris N. Metaxas
IEEE Transactions on Pattern Analysis and Machine…
2003
Corpus ID: 11733688
We present a method for the integration of nonlinear holonomic constraints in deformable models and its application to the…
Expand
Highly Cited
2001
Highly Cited
2001
Utility-based power control in cellular wireless systems
Mingbo Xiao
,
N. Shroff
,
E. Chong
Proceedings IEEE INFOCOM . Conference on Computer…
2001
Corpus ID: 12262184
Distributed power control algorithms for systems with hard SIR constraints may diverge when infeasibility arises. We present a…
Expand
Highly Cited
1996
Highly Cited
1996
Nonlinear Optimization and Applications
G. Pillo
,
F. Giannessi
Springer US
1996
Corpus ID: 26643339
Towards a Discrete Newton Method with Memory for Largescale Optimization R.H. Byrd, et al. On Regularity for Generalized Systems…
Expand
Highly Cited
1994
Highly Cited
1994
Using a genetic algorithm to optimize problems with feasibility constraints
David Orvosh
,
L. Davis
Proceedings of the First IEEE Conference on…
1994
Corpus ID: 980682
G.E. Liepins et al. (1990) have shown that genetic algorithm optimization of certain combinatorial optimization problems can be…
Expand
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)
ACCEPT & CONTINUE