๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Lagrangian regularization approach to constrained optimization problems

โœ Scribed by Shaohua Pan; Xingsi Li

Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
201 KB
Volume
59
Category
Article
ISSN
0362-546X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A partial parallel splitting augmented L
A partial parallel splitting augmented Lagrangian method for solving constrained matrix optimization problems
โœ Zheng Peng; Donghua Wu ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 347 KB

Alternating directions methods (ADMs) are very effective for solving convex optimization problems with separable structure. However, when these methods are applied to solve convex optimization problems with three separable operators, their convergence results have not been established as yet. In thi

Co-evolutionary particle swarm optimizat
Co-evolutionary particle swarm optimization to solve constrained optimization problems
โœ Xiaoli Kou; Sanyang Liu; Jianke Zhang; Wei Zheng ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 504 KB

This paper presents a co-evolutionary particle swarm optimization (CPSO) algorithm to solve global nonlinear optimization problems. A new co-evolutionary PSO (CPSO) is constructed. In the algorithm, a deterministic selection strategy is proposed to ensure the diversity of population. Meanwhile, base

Lagrangian relaxation approach to the ta
Lagrangian relaxation approach to the targeting problem
โœ Ojeong Kwon; Donghan Kang; Kyungsik Lee; Sungsoo Park ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 116 KB

In this paper, we consider a new weapon-target allocation problem with the objective of minimizing the overall firing cost. The problem is formulated as a nonlinear integer programming model. We applied Lagrangian relaxation and a branch-and-bound method to the problem after transforming the nonline