✦ LIBER ✦

FEASIBLE DESCENT CONE METHODS FOR INEQUALITY CONSTRAINED OPTIMIZATION PROBLEMS

✍ Scribed by J. A. SNYMAN; N. STANDER

Publisher: John Wiley and Sons
Year: 1996
Tongue: English
Weight: 784 KB
Volume: 39
Category: Article
ISSN: 0029-5981
DOI: 10.1002/(sici)1097-0207(19960430)39:8<1341::aid-nme907>3.0.co;2-j

No coin nor oath required. For personal study only.

✦ Synopsis

A new Feasible Descent Cone (FDC) method for constrained optimization, previously restricted to linear objectives, is here generalized to include non-linear objective functions as well. In the basic and exact algorithm a sequence of descent steps is taken through the interior of the feasible region along the central lines of mathematically defined descent cones, constructed at successive boundary points. Here the basic algorithm is modified to allow for a minimum to occur within the interior, along a central descent ray in the case of non-linear objectives. A special interior procedure, with desirable mathematical properties, is adopted should the latter occur. To ensure economic implementation, the new generalized and exact algorithm, referred to as SSOPT2, is successively applied to a sequence of approximate quadratic subproblems. The overall generalized procedure that includes the successive application of SSOPT2 to the approximate subproblems, is referred to as the successive approximation version 2 algorithm (SAM2). The practical performance of SAM2 is assessed through its application to a number of small but otherwise representative test problems.

📜 SIMILAR VOLUMES

Legendre wavelets method for constrained

Legendre wavelets method for constrained optimal control problems

✍ Mohsen Razzaghi; Sohrabali Yousefi 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 92 KB

## Abstract A numerical method for solving non‐linear optimal control problems with inequality constraints is presented in this paper. The method is based upon Legendre wavelet approximations. The properties of Legendre wavelets are first presented. The operational matrix of integration and the Gau

Preconditioning methods for linear syste

Preconditioning methods for linear systems arising in constrained optimization problems

✍ Owe Axelsson; Maya Neytcheva 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 222 KB 👁 1 views

Indefinitely preconditioned conjugate gr

Indefinitely preconditioned conjugate gradient method for large sparse equality and inequality constrained quadratic problems

✍ C. Durazzi; V. Ruggiero 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB

## Abstract This paper is concerned with the numerical solution of a symmetric indefinite system which is a generalization of the Karush–Kuhn–Tucker system. Following the recent approach of Lukšan and Vlček, we propose to solve this system by a preconditioned conjugate gradient (PCG) algorithm and

Bifurcation Analysis for Singularities o

Bifurcation Analysis for Singularities on a Tangent Space for Quadratic Penalty-Barrier and Multipliers Methods for Solving Constrained Optimization Problems, Part I

✍ Mohammed A. Hasan; Aubrey B. Poore 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 278 KB

Analysis of Bifurcation Due to Loss of L

Analysis of Bifurcation Due to Loss of Linear Independence and Strict Complementarity for Penalty Methods for Solving Constrained Optimization Problems, II

✍ Mohammed A. Hasan; Aubrey B. Poore 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 342 KB

A gradient-only line search method for t

A gradient-only line search method for the conjugate gradient method applied to constrained optimization problems with severe noise in the objective function

✍ J. A. Snyman 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 100 KB

A new implementation of the conjugate gradient method is presented that economically overcomes the problem of severe numerical noise superimposed on an otherwise smooth underlying objective function of a constrained optimization problem. This is done by the use of a novel gradient-only line search t