Optimization by the Fixed-Point Method, Version 2.11

Jalaluddin Abdullah (hjjalalstreamyx.com)

Abstract: Abstract: After developing necessary background theory, the original primal and dual are specified, and the invariant primal and dual LP's are defined. Pairs of linear mappings are defined which establish an effectively one-to-one correspondences between solutions to the original and invariant problems. The invariant problems are recast as a fixed-point problem and precise solution conditions for the fixed-point problem are found. The fixed-point problem is solved by asymptotic 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: [Postscript][PDF]

Entry Submitted: 09/09/2007
Entry Accepted: 09/11/2007
Entry Last Modified: 11/25/2011

Modify/Update this entry