A deterministic rescaled perceptron algorithm-Reference-Cited by-同舟云学术

A deterministic rescaled perceptron algorithm

Published:2015-01-17 Issue:1-2 Volume:155 Page:497-510
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Math. Program.

Author:

Peña Javier,Soheili Negar

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/s10107-015-0860-y.pdf

Reference24 articles.

1. Agmon, S.: The relaxation method for linear inequalities. Can. J. Math. 6(3), 382–392 (1954)

2. Amaldi, E., Belotti, P., Hauser, R.: A randomized algorithm for the maxFS problem. In: IPCO, pp. 249–264 (2005)

3. Amaldi, E., Hauser, R.: Boundedness theorems for the relaxation method. Math. Oper. Res. 30(4), 939–955 (2005)

4. Ball, K.: An Elementary Introduction to Modern Convex Geometry. Flavors of Geometry, vol. 31, pp. 1–58. Cambridge University Press, Cambridge (1997)

5. Bauschke, H.H., Borwein, J.M.: Legendre functions and the method of random Bregman projections. J. Convex Anal. 4, 27–67 (1997)

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

1. A New Algorithm for Linear Programming in Critical Systems;SN Computer Science;2022-12-01

2. Projection and Rescaling Algorithm for Finding Maximum Support Solutions to Polyhedral Conic Systems;Mathematics of Operations Research;2022-11

3. Implementation of a projection and rescaling algorithm for second-order conic feasibility problems;Optimization Methods and Software;2022-10-06

4. Solving Linear Programming While Tackling Number Representation Issues;Proceedings of the 11th International Conference on Operations Research and Enterprise Systems;2022

5. Geometric Rescaling Algorithms for Submodular Function Minimization;Mathematics of Operations Research;2021-08