Journal: Journal of Systems Science and Complexity

Found 70 papers in total
A generalized gradient method for nonlinear constraints and its convergent properties
A generalized gradient method for nonlinear constraints and its convergent properties
1996,
Although many effective algorithms of the gradient projection type have been proposed...
A new sufficient condition for the convergence of the Davidon–Fletcher–Powell algorithm with Wolfe line search
A new sufficient condition for the convergence of the Davidon–Fletcher–Powell algorithm with Wolfe line search
1996,
The DFP algorithm is one of the most famous numerical algorithms for unconstrained...
A logarithmic barrier Newton method for semidefinite programming
A logarithmic barrier Newton method for semidefinite programming
1997,
In this paper, by analyzing the properties of the central path, the authors give a...
Optimality conditions for nonconvex bilevel programming problems
Optimality conditions for nonconvex bilevel programming problems
1997,
In this paper, the authors derive an exact penalty function for nonconvex bilevel...
Direct ellipsoid method for convex quadratic program
Direct ellipsoid method for convex quadratic program
1996,
This paper shows how to apply the ellipsoid method directly to the convex quadratic...
The optimality conditions and properties of linear multilevel programming problem
The optimality conditions and properties of linear multilevel programming problem
1998,
In this paper a model for the linear multilevel programming problem is presented,...
Panconnectivity and 2-connected claw-free graphs
Panconnectivity and 2-connected claw-free graphs
1996,
In this paper, the authors show that the two distinct vertices u and v of a...
Minimum fill-in problem of graphs
Minimum fill-in problem of graphs
1996,
The computational complexity of the minimum fill-in problem of graphs is discussed in...
1/2 transitive graphs associated with linear groups
1/2 transitive graphs associated with linear groups
1996,
In this paper, the author considers the action of G+PSL ( n, p ) ( n ≥ 3, p is...
Largest cycles in 2-connected claw-free graphs
Largest cycles in 2-connected claw-free graphs
1997,
Matthews and Sumner proved that if G is a 2-connected claw-free graph of order n ,...
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 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...
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....
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...
On the convergence of conjugate gradient methods invariant to nonlinear scaling
On the convergence of conjugate gradient methods invariant to nonlinear scaling
1996,
In order to construct more efficient methods for unconstrained optimization problems,...
A generalized gradient method for nonlinear constraints and its convergent properties
A generalized gradient method for nonlinear constraints and its convergent properties
1996,
Although many effective algorithms of the gradient projection type have been proposed...
A new sufficient condition for the convergence of the DFP algorithm with Wolfe line search
A new sufficient condition for the convergence of the DFP algorithm with Wolfe line search
1996,
The Davidon–Fletcher–Powell (DFP) algorithm is one of the most famous...
Symmetric duality for a class of multiobjective fractional programming
Symmetric duality for a class of multiobjective fractional programming
1997,
A pair of symmetric duals for a class of nondifferentiable multiobjective fractional...
A logarithmic barrier Newton method for semidefinite programming
A logarithmic barrier Newton method for semidefinite programming
1997,
In this paper, by analyzing the properties of the central path, the authors give a...
Optimality conditions for nonconvex bilevel programming problems
Optimality conditions for nonconvex bilevel programming problems
1997,
In this paper, the authors derive an exact penalty function for nonconvex bilevel...
The convergence of Broyden algorithms without convexity assumption
The convergence of Broyden algorithms without convexity assumption
1997,
In this paper, the author discusses the convergence of the Broyden algorithms without...
A class of algorithms using successive quadratic programming with perturbations and its global convergence
A class of algorithms using successive quadratic programming with perturbations and its global convergence
1990,
In this paper, a class of successive quadratic programming algorithms for NP is...
Papers per page: