Separating plane algorithms for convex optimization-Reference-Cited by-同舟云学术

Separating plane algorithms for convex optimization

Published:1997-03 Issue:3 Volume:76 Page:373-391
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Nurminski Evgeni A.

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

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

Reference30 articles.

1. V.F. Demyanov and V.N. Malozemov,Introduction to Minimax (Wiley, New York, 1974).

2. S.-P. Han and O. Mangasarian, Exact penalty functions in nonlinear programming,Mathematical Programming 17 (1979) 251–269.

3. J.-B. Hiriart-Urruty and C. Lemaréchal,Convex Analysis and Minimization Algorithms, Parts I and II (Springer, Berlin, 1993).

4. J.B. Kelley, The cutting plane method for solving convex programs,SIAM 8(4) (1960) 703–712.

5. K. Kiwiel, A survey of bundle methods for nondifferentiable optimization, in:Proceedings, XIII International Symposium on Mathematical Programming (Tokyo, 1988).

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

1. Data fitting problem under interval uncertainty in data;Industrial laboratory. Diagnostics of materials;2020-01-30

2. Weak and Strong Compatibility in Data Fitting Problems Under Interval Uncertainty;Advances in Data Science and Adaptive Analysis;2020-01

3. Interval Regularization for Inaccurate Linear Algebraic Equations;Studies in Computational Intelligence;2020

4. A conceptual conjugate epi-projection algorithm of convex optimization: superlinear, quadratic and finite convergence;Optimization Letters;2018-05-04

5. Maximum compatibility method for data fitting under interval uncertainty;Journal of Computer and Systems Sciences International;2017-11