On Effectively Computing the Analytic Center of the Solution Set by Primal-Dual Interior-Point Methods

Simple item page
dc.contributor.authorGonzález-Lima, María D.
dc.contributor.authorTapia, Richard A.
dc.contributor.authorPotra, Florian
dc.date.accessioned2018-06-18T17:42:19Z
dc.date.available2018-06-18T17:42:19Z
dc.date.issued1995-08
dc.date.noteAugust 1995 (Revised July 1996)
dc.description.abstractThe computation of the analytic center of the solution set can be important in linear programming applications where it is desirable to obtain a solution that is not near the relative boundary of the solution set. In this work we discuss the effective computation of the analytic center solution by the use of primal-dual interior-point methods. A primal-dual interior-point algorithm designed for effectively computing the analytic-center solution is proposed and theory and numerical results are presented.
dc.format.extent36 pp
dc.identifier.citationGonzález-Lima, María D., Tapia, Richard A. and Potra, Florian. "On Effectively Computing the Analytic Center of the Solution Set by Primal-Dual Interior-Point Methods." (1995) <a href="https://hdl.handle.net/1911/101867">https://hdl.handle.net/1911/101867</a>.
dc.identifier.digitalTR95-26
dc.identifier.urihttps://hdl.handle.net/1911/101867
dc.language.isoeng
dc.relation.HasVersionSIAM J. Optim. 8 (1998), no. 1, 1-25
dc.titleOn Effectively Computing the Analytic Center of the Solution Set by Primal-Dual Interior-Point Methods
dc.typeTechnical report
dc.type.dcmiText
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR95-26.pdf
Size:
550.73 KB
Format:
Adobe Portable Document Format
Download
Collections
CAAM Technical Reports