On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm-Reference-Cited by-同舟云学术

On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm

Published:1993-06 Issue:1-3 Volume:60 Page:81-92
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Goffin J. L.,Vial J. P.

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01580602.pdf

Reference25 articles.

1. I. Adler and R.D.C. Monteiro, “Limiting behaviour of the affine scaling continuous trajectories for linear programming problems,”Mathematical Programming 50 (1991) 29–51.

2. working paper;K. Anstreicher,1988

3. G. de Ghellinck and J.-P. Vial, “A polynomial Newton method for linear programming,”Algorithmica 1 (1986) 425–453.

4. D. den Hertog, C. Roos and T. Terlaky, “A polynomial method of weighted centers for convex quadratic programming,” Report 90-17, Delft Univ. of Technology (Delft, 1990).

5. working paper;R. Freund,1988

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

1. A J-symmetric quasi-newton method for minimax problems;Mathematical Programming;2023-04-20

2. Learning From Human Directional Corrections;IEEE Transactions on Robotics;2023-02

3. Piecewise Learning and Control with Stability Guarantees;Model‐Based Reinforcement Learning;2022-12-02

4. An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix;INFORMS Journal on Computing;2021-11-02

5. Learning lyapunov functions for hybrid systems;Proceedings of the 24th International Conference on Hybrid Systems: Computation and Control;2021-05-19