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)

Related topics

Related topics

34 relations
ABS methodsBOBYQABlack–Litterman modelBranch and bound

Broader (1)

Constraint programming

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
STACL: Simultaneous Translation with Integrated Anticipation and Controllable Latency
Simultaneous translation, which translates sentences before they are finished, is useful in many scenarios but is notoriously… 
2013
2013
Simulated annealing and metaheuristic for randomized priority search algorithms for the aerial refuelling parallel machine scheduling problem with due date-to-deadline windows and release times
This article addresses the aerial refuelling scheduling problem (ARSP), where a set of fighter jets (jobs) with certain ready… 
2013
2013
Satellite Image Classification Using Morphological Component Analysis of Texture and Cartoon Layers
In this letter, we proposed a high-resolution satellite image classification method using morphological component analysis of… 
2007
2007
Fast Recovery for a CELP-Like Speech Codec After a Frame Erasure
The adaptive codebook used in code-excited linear prediction (CELP)-like speech codecs is very effective for modeling the quasi… 
2004
2004
Soft constraint satisfaction multimodulus blind equalization algorithms
In this work, a new algorithm, based on the minimum-disturbance principle with relaxation, is presented for the blind… 
2003
2003
Multiple protein structure alignment by deterministic annealing
  • Luonan Chen
  • Computational Systems Bioinformatics. CSB…
  • 2003
  • Corpus ID: 39337966
In this paper, we propose a novel method for solving multiple structure alignment problem, based on mean field annealing… 
2002
2002
Global and Local Convergence of Line Search Filter Methods for Nonlinear Programming
Line search methods for nonlinear programming using Fletcher and Leyffer’s filter method, which replaces the traditional merit… 
2002
2002
Solving Constraint Optimization Problems from CLP-Style Specifications Using Heuristic Search Techniques
Presents a framework for efficiently solving logic formulations of combinatorial optimization problems using heuristic search… 
1995
1995
Global Convergence of Inexact Reduced SQP Methods
  • H. JägerE. Sachs
  • Universität Trier, Mathematik/Informatik…
  • 1995
  • Corpus ID: 32101094
In this paper we consider infinite dimensional optimization problems with equality constraints. The basic underlying algorithm is… 
1969
1969
A New Method for Constrained Optimization Problems
This paper describes an algorithm, based on a recently proposed method due to D. D. Morrison, for solving constrained… 
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)