scholarly journals A variable-metric variant of the Karmarkar algorithm for linear programming

1987 ◽  
Vol 39 (1) ◽  
pp. 1-20 ◽  
Author(s):  
J. E. Dennis ◽  
A. M. Morshedi ◽  
Kathryn Turner
1987 ◽  
Author(s):  
Jr Dennis ◽  
Morshedi J. E. ◽  
Turner A. M. ◽  
Kathryn

Author(s):  
U. Helmke

AbstractBrockett has studied the isospectral flow Ḣ = [H, [H, N]], with [A, B] = AB ∔ BA, on spaces of real symmetric matrices. The flow diagonalises real symmetric matrices and can be used to solve linear programming problems with compact convex constraints. We show that the flow converges exponentially fast to the optimal solution of the programming problem and we give explicit estimates for the time needed by the flow to approach an ε-neighbourhood of the optimum. An interior point algorithm for the standard simplex is analysed in detail and a comparison is made with a continuous time version of Karmarkar algorithm.


1997 ◽  
Vol 48 (7) ◽  
pp. 757-758
Author(s):  
B Kolman ◽  
R E Beck ◽  
M J Panik
Keyword(s):  

2020 ◽  
Vol 64 (1-4) ◽  
pp. 1447-1452
Author(s):  
Vincent Mazauric ◽  
Ariane Millot ◽  
Claude Le Pape-Gardeux ◽  
Nadia Maïzi

To overcome the negative environemental impact of the actual power system, an optimal description of quasi-static electromagnetics relying on a reversible interpretation of the Faraday’s law is given. Due to the overabundance of carbon-free energy sources, this description makes it possible to consider an evolution towards an energy system favoring low-carbon technologies. The management for changing is then explored through a simplified linear-programming problem and an analogy with phase transitions in physics is drawn.


Sign in / Sign up

Export Citation Format

Share Document