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

Computational Discretization Algorithms for Functional Inequality Constrained Optimization

โœ Scribed by K.L. Teo; X.Q. Yang; L.S. Jennings

Book ID
110386848
Publisher
Springer US
Year
2000
Tongue
English
Weight
125 KB
Volume
98
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A new computational method for the funct
A new computational method for the functional inequality constrained minimax optimization problem
โœ D.C. Jiang; K.L. Teo; W.Y. Yan ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 715 KB

In this paper, we consider a general class of functional inequality constrained minimax optimization problems. This problem is first converted into a semi-infinite programming problem. Then, an auxiliary cost function is constructed based on a positive saturated function. The smallest zero of this a

An efficient feasible SQP algorithm for
An efficient feasible SQP algorithm for inequality constrained optimization
โœ Zhibin Zhu; Jinbao Jian ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 454 KB

In this paper, an efficient feasible SQP method is proposed to solve nonlinear inequality constrained optimization problems. Here, a new modified method is presented to obtain the revised feasible descent direction. Per single iteration, it is only necessary to solve one QP subproblem and a system o