𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Effect of dimension on direct search methods for constrained optimization

✍ Scribed by Gade Pandu Rangaiah


Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
162 KB
Volume
9
Category
Article
ISSN
0098-1354

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A superlinearly convergent method of qua
✍ Jin-bao Jian; Yi Liu πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 297 KB

Combining the norm-relaxed sequential quadratic programming (SQP) method and the idea of method of quasi-strongly sub-feasible directions (MQSSFD) with active set identification technique, a new SQP algorithm for solving nonlinear inequality constrained optimization is proposed. Unlike the previous

A generalized super-memory gradient proj
✍ Jin-Bao Jian; You-Fang Zeng; Chun-Ming Tang πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 362 KB

In this work, combining the properties of the generalized super-memory gradient projection methods with the ideas of the strongly sub-feasible directions methods, we present a new algorithm with strong convergence for nonlinear inequality constrained optimization. At each iteration, the proposed alg

092024 (M12) On minimax optimality of th
πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 88 KB

Yushkevich can also be applied to certain models where control of the flow is possible. The method consists in a transformation to a model without control of the flow by a kind of time change.