Optimization by the Fixed-Point Method, Version 2.01

Jalaluddin Abdullah (hjjalalstreamyx.com)

Abstract: From an original LP an invariant dual and primal are constructed; solutions to the invariant primal are related to the original LP; from the invariant problems a fixed-point problem is created; solutions to the fixed-point problem are related to the invariant problems; the fixed-point problem is solved by assymptotic and terminating methods; operational conditions for the solution of convex programs, alternative to the Kuhn-Tucker conditions, are developed.

Keywords: optimization, linear programming, non-linear programming, fixed-point method

Category 1: Linear, Cone and Semidefinite Programming (Linear Programming )

Category 2: Nonlinear Optimization (Constrained Nonlinear Optimization )

Citation: Optimization by the Fixed-Point Method 2.01.pdf, by Jalaluddin Abdullah, 9 Sept. 2009, Bittorrent, http://tracker.prq.to/announce, hash: c75d0c3aef4d77eb52ac1462221cf6b5e37b8705

Download: [PDF]

Entry Submitted: 09/09/2007
Entry Accepted: 09/11/2007
Entry Last Modified: 10/09/2009

Modify/Update this entry