Enhanced basic procedures for the projection and rescaling algorithm

David Huckleberry Gutman

doi:10.1007/s11590-019-01390-4

Enhanced basic procedures for the projection and rescaling algorithm

David Huckleberry Gutman

Industrial Engineering

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

Using an efficient algorithmic implementation of Caratheodory’s theorem, we propose three enhanced versions of the projection and rescaling algorithm’s basic procedures. Each of these enhanced procedures improves upon the order of complexity of its analogue in Peña and Soheili (Math Program 166(1):87–111, 2017) when the dimension of the subspace is sufficiently smaller than the dimension of its ambient space.

Original language	English
Pages (from-to)	1259-1267
Number of pages	9
Journal	Optimization Letters
Volume	13
Issue number	6
DOIs	https://doi.org/10.1007/s11590-019-01390-4
State	Published - Sep 1 2019

Keywords

Basic procedure
Linear feasibility
Perceptron
Projection and rescaling
von Neumann

Access to Document

10.1007/s11590-019-01390-4

Cite this

@article{e873a3ef4cfe48c7921bdf3479e6352d,

title = "Enhanced basic procedures for the projection and rescaling algorithm",

abstract = "Using an efficient algorithmic implementation of Caratheodory{\textquoteright}s theorem, we propose three enhanced versions of the projection and rescaling algorithm{\textquoteright}s basic procedures. Each of these enhanced procedures improves upon the order of complexity of its analogue in Pe{\~n}a and Soheili (Math Program 166(1):87–111, 2017) when the dimension of the subspace is sufficiently smaller than the dimension of its ambient space.",

keywords = "Basic procedure, Linear feasibility, Perceptron, Projection and rescaling, von Neumann",

author = "Gutman, {David Huckleberry}",

note = "Publisher Copyright: {\textcopyright} 2019, Springer-Verlag GmbH Germany, part of Springer Nature.",

year = "2019",

month = sep,

day = "1",

doi = "10.1007/s11590-019-01390-4",

language = "English",

volume = "13",

pages = "1259--1267",

journal = "Optimization Letters",

issn = "1862-4472",

number = "6",

}

TY - JOUR

T1 - Enhanced basic procedures for the projection and rescaling algorithm

AU - Gutman, David Huckleberry

PY - 2019/9/1

Y1 - 2019/9/1

N2 - Using an efficient algorithmic implementation of Caratheodory’s theorem, we propose three enhanced versions of the projection and rescaling algorithm’s basic procedures. Each of these enhanced procedures improves upon the order of complexity of its analogue in Peña and Soheili (Math Program 166(1):87–111, 2017) when the dimension of the subspace is sufficiently smaller than the dimension of its ambient space.

AB - Using an efficient algorithmic implementation of Caratheodory’s theorem, we propose three enhanced versions of the projection and rescaling algorithm’s basic procedures. Each of these enhanced procedures improves upon the order of complexity of its analogue in Peña and Soheili (Math Program 166(1):87–111, 2017) when the dimension of the subspace is sufficiently smaller than the dimension of its ambient space.

KW - Basic procedure

KW - Linear feasibility

KW - Perceptron

KW - Projection and rescaling

KW - von Neumann

UR - http://www.scopus.com/inward/record.url?scp=85069974207&partnerID=8YFLogxK

U2 - 10.1007/s11590-019-01390-4

DO - 10.1007/s11590-019-01390-4

M3 - Article

AN - SCOPUS:85069974207

VL - 13

SP - 1259

EP - 1267

JO - Optimization Letters

JF - Optimization Letters

SN - 1862-4472

IS - 6

ER -

Enhanced basic procedures for the projection and rescaling algorithm

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this