A First-order e-approximation algorithm for linear programs and a second-order implementation
This article presents an algorithm that finds an e-feasible solution relatively to some constraints of a linear program. The algorithm is a first-order feasible directions method with constant stepsize that attempts to find the minimizer of an exponential penalty function. When embedded with bisecti...
Main Author: | |
---|---|
Other Authors: | , |
Format: | conferencePaper |
Language: | eng |
Published: |
2005
|
Subjects: | |
Online Access: | http://hdl.handle.net/1822/5414 |
Country: | Portugal |
Oai: | oai:repositorium.sdum.uminho.pt:1822/5414 |