Skip to search formSkip to main contentSkip to account menu

Penalty method

Known as: Penalty coefficient, Penalty function, Penalty methods 
Penalty methods are a certain class of algorithms for solving constrained optimization problems. A penalty method replaces a constrained optimization… 
Wikipedia (opens in a new tab)

Related topics

Related topics

11 relations
AlgorithmAugmented Lagrangian methodBarrier functionConstrained optimization

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Recurrent Neural Networks for Word Alignment Model
This study proposes a word alignment model based on a recurrent neural network (RNN), in which an unlimited alignment history is… 
Highly Cited
2013
Highly Cited
2013
Resource allocation using particle swarm optimization for D2D communication underlay of cellular networks
Device-to-device (D2D) communications as underlays of cellular networks facilitate diverse local services and reduce base station… 
Highly Cited
2008
Highly Cited
2008
The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
Highly Cited
2007
Highly Cited
2007
An Optimization Framework for Conformal Radiation Treatment Planning
An optimization framework for three-dimensional conformal radiation therapy is presented. In conformal therapy, beams of… 
Highly Cited
2005
Highly Cited
2005
Constrained optimization by applying the /spl alpha/ constrained method to the nonlinear simplex method with mutations
Constrained optimization problems are very important and frequently appear in the real world. The /spl alpha/ constrained method… 
Highly Cited
2005
Highly Cited
2005
A line up evolutionary algorithm for solving nonlinear constrained optimization problems
Highly Cited
2004
Highly Cited
2004
Using tabu search with longer-term memory and relaxation to create examination timetables
Highly Cited
2001
Highly Cited
2001
On the Use of Linear Models for the Design of Water Utilization Systems in Process Plants with a Sin
This paper addresses the optimum design of water utilization systems when a single contaminant is present. The application of the… 
Highly Cited
2001
Highly Cited
2001
Speeding Up Materialized View Selection in Data Warehouses Using a Randomized Algorithm
A data warehouse stores information that is collected from multiple, heterogeneous information sources for the purpose of complex… 
Highly Cited
2000
Highly Cited
2000
Scheduling with generalized batch delivery dates and earliness penalties
In this paper, we study some single machine scheduling problems with generalized batch delivery dates and earliness penalties… 
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)