|Table of Contents|

A Projective Dynamic Method for SolvingLinear Programming(PDF)

《南京师大学报（自然科学版）》[ISSN:1001-4616/CN:32-1239/N]

Issue:
2015年04期
Page:
8-
Research Field:
数学
Publishing date:

Info

Title:
A Projective Dynamic Method for SolvingLinear Programming
Author(s):
Sun Liming
School of Science，Nanjing Audit University，Nanjing 211815，China
Keywords:
linear programming; continuous method; variational inequality; projective dynamic method
PACS:
90C25，68Q25，62J05
DOI:
-
Abstract:
In this paper，we propose a projective dynamic method for minimizing general linear programming. The new method is based on the variational inequality（VI）properties. We extend the variational inequality method to construct a new ODE system. The preliminary numerical results are reported and the new dynamics is shown to be very useful to solve large scale optimization problems.

References:

［1］FLETCHER R. Practical methods of optimization［M］. 2nd ed. New York：John Wiley and Sons，1987.
［2］LIAO L Z. A continuous method for convex programming problems［J］. J Optim Theory and Appl，2005（124）：207-226.
［3］HE B S. A modified projection and contraction method for a class of linear complementarity problems［J］. J Comput Math，1996（14）：54-63.
［4］EAVES B C. On the basic theorem of complementarity［J］. Math Programming，1971（1）：68-75.
［5］HARKER P T，PANG J S. A damped-Newton method for the linear complementarity problem［M］//Computational Solution of Nonlinear Systems of Equations：Lectures in Applied Mathematics. USA：American Mathematical Society，1990：265-284.
［6］CICHOCKI A，UNBEHAUEN R. Neural networks for optimization and signal processing［M］. London，UK：Wiley，1993.
［7］HAN Q M，LIAO L Z，QI H D，et al. Stability analysis of gradient-based neural networks for optimization problems［J］. J Global Optim，2001（19）：363-381.

Memo

Memo:
-
Last Update: 2015-12-30