Two Logarithmic Barrier Methods for Convex Semi-Infinite Problems-Reference-Cited by-同舟云学术

Two Logarithmic Barrier Methods for Convex Semi-Infinite Problems

Published:2001 Issue: Volume: Page:169-195
ISSN:1571-568X
Container-title:Nonconvex Optimization and Its Applications
language:
Short-container-title:

Author:

Abbe Lars

Publisher

Springer US

Link

http://link.springer.com/content/pdf/10.1007/978-1-4757-3403-4_8

Reference22 articles.

1. L. Abbe. Two logarithmic barrier methods for convex semi-infinite pro gramming problems, Forschungsbericht 99–30, Universität Trier, 1999.

2. M. C. Ferris and A. B. Philpott. An interior point algorithm for semi infinite linear programming, Mathematical Programming, A43:257–276, 1989.

3. A. V. Fiacco and K. O. Kortanek, editors. Semi-Infinite Programming and Applications, University of Trier, Volume 215 of Lecture Notes in Economics and Mathematical Systems, Springer, 1983.

4. A. V. Fiacco and G. P. McCormick. Nonlinear Programming: Sequential Unconstrained Minimization Techniques, Wiley, 1968.

5. R. Fletcher. A general quadratic programming algorithm, Journal of the Institute of Mathematics and its Application, 7:76–91, 1971.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. γ-Active Constraints in Convex Semi-Infinite Programming;Numerical Functional Analysis and Optimization;2014-07-03

2. Smoothing by mollifiers. Part I: semi-infinite optimization;Journal of Global Optimization;2007-10-03

3. Linear semi-infinite programming theory: An updated survey;European Journal of Operational Research;2002-12

4. Linear Semi-infinite Optimization: Recent Advances;Continuous Optimization