Country: China

Found 1356 papers in total
The ascending subgraph decomposition of Kn–H2n–1
The ascending subgraph decomposition of Kn–H2n–1
1997,
A conjecture concerning a new kind of subgraph decomposition, the ascending subgraph...
A class of factorization update algorithms for solving systems of sparse nonlinear equations
A class of factorization update algorithms for solving systems of sparse nonlinear equations
1996,
In this paper, they established a class of sparse update algorithm based on matrix...
An efficient primal–dual algorithm for shortest path problem
An efficient primal–dual algorithm for shortest path problem
1997,
There are numerous problems in combinatorial optimization. Their solutions are...
Mathematical analysis of some neural networks for solving linear and quadratic programming
Mathematical analysis of some neural networks for solving linear and quadratic programming
1996,
Artificial neural network techniques have been introduced into the area of...
Trust region method in neural network
Trust region method in neural network
1997,
A Hopfield-type neural network with adaptively changing synaptic weights and...
Predictor–corrector method for nonlinear complementarity problem
Predictor–corrector method for nonlinear complementarity problem
1997,
Ye et al . proved that the predictor–corrector method proposed by Mizuno et al ....
Ordinary differentiable equation methods for solving convex programming problems with bounded variables
Ordinary differentiable equation methods for solving convex programming problems with bounded variables
1995,
In this paper, the author reformulates the convex programming problem with bounded...
On a decomposition for generic posynomial geometric programming
On a decomposition for generic posynomial geometric programming
1995,
Some decomposition methods for a special class of geometric programming problems were...
A homotopy interior algorithm for posynomial geometric programming
A homotopy interior algorithm for posynomial geometric programming
1996,
In this paper, the authors establish a Newton-type homotopy interior-point algorithm...
A new algorithm for pure 0–1 linear programs with inequality constraints
A new algorithm for pure 0–1 linear programs with inequality constraints
1996,
More and more attention has been paid to the Hybrid Neural Network (HNN) algorithm...
General form of stepsize selection rules of linesearch and relevant analysis of global convergence of the BFGS algorithm
General form of stepsize selection rules of linesearch and relevant analysis of global convergence of the BFGS algorithm
1995,
In this paper, a new stepsize rule for unconstrained optimization methods is...
A new polynomial-time algorithm for Linear Programming
A new polynomial-time algorithm for Linear Programming
1996,
In this paper, the authors present a new polynomial-time algorithm for linear...
An extension of predictor–corrector algorithm to a class of convex separable program
An extension of predictor–corrector algorithm to a class of convex separable program
1997,
The predictor–corrector algorithm for linear programming, presented by Mizuno et...
A modified projection and contraction method for a class of linear complementarity problems
A modified projection and contraction method for a class of linear complementarity problems
1996,
The author had proposed an iterative projection and contraction (PC) method for a...
A modified bisection simplex method for linear programming
A modified bisection simplex method for linear programming
1996,
In this paper, a modification of the bisection simplex method is made for more general...
Minimum principles and error bounds for monotone linear complementarity problems (I)
Minimum principles and error bounds for monotone linear complementarity problems (I)
1995,
The main results in this paper (I) can be summarized into the following two parts: (1)...
Minimum principles and error bounds for monotone linear complementarity problems (II)
Minimum principles and error bounds for monotone linear complementarity problems (II)
1995,
Another type of minimum principle is presented for a monotone linear complementarity...
A simplex-interior algorithm for solving linear programming
A simplex-interior algorithm for solving linear programming
1996,
Starting with the simplex method and long step path following algorithm, the author...
A maximum entropy method for linear programming
A maximum entropy method for linear programming
1995,
In this paper, an ε-optimal solution to a linear programming problem in Karmarkar...
A generalized predictor–corrector linear programming algorithm
A generalized predictor–corrector linear programming algorithm
1995,
According to the homogeneous and self-dual linear programming model and the reduced...
An optimal basis identification criterion for interior-point linear programming algorithms
An optimal basis identification criterion for interior-point linear programming algorithms
1996,
In this paper, the properties of an indicator vector for identifying an optimal basis...
A hybrid polynomial algorithm for linear programming
A hybrid polynomial algorithm for linear programming
1996,
In this paper, the authors propose a ‘long step’ double scaling algorithm....
On some projection and contraction methods for solving monotone variational inequalities
On some projection and contraction methods for solving monotone variational inequalities
1996,
Variational inequalities play a significant role in mathematical programming and have...
Quasi-concave multiple objective programming with cone structure
Quasi-concave multiple objective programming with cone structure
1996,
In this paper, basic theory of ‘cone quasi-concave multiple objective...
Papers per page: