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
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
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
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.