Country: China

Found 1356 papers in total
Quasi-concave multiple objective programming with cone structure
Quasi-concave multiple objective programming with cone structure
1996,
In this paper, some basic theory of ‘cone quasi-concave multiple objective...
Nonconical nonsmooth multiobjective programming-optimality conditions and duality theorems
Nonconical nonsmooth multiobjective programming-optimality conditions and duality theorems
1998,
This paper deals with nonconical nonsmooth multiobjective programming problem. The...
A new method for finding major efficient solutions and major optimal solutions of discrete multiobjective programming
A new method for finding major efficient solutions and major optimal solutions of discrete multiobjective programming
1998,
Major efficiency is an efficiency theory of multiobjective programming, which is based...
A trust region algorithm for bilevel programming problems
A trust region algorithm for bilevel programming problems
1998,
A trust region algorithm is proposed for solving bilevel programming problems where...
Convergence properties of general trust region algorithms based on the conic model
Convergence properties of general trust region algorithms based on the conic model
1998,
This paper presents a general model of trust region algorithm, including the usual...
A trust region algorithm for unconstrained nonsmooth optimizations and its convergence
A trust region algorithm for unconstrained nonsmooth optimizations and its convergence
1998,
This paper discusses a trust region algorithm for unconstrained nonsmooth...
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 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...
Interior ellipsoid method for convex quadratic programming
Interior ellipsoid method for convex quadratic programming
1996,
In this paper, a new variant of the interior ellipsoid method for convex quadratic...
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...
Principles for modelling financial markets and the optimal growth of wealth process
Principles for modelling financial markets and the optimal growth of wealth process
1998,
In this paper, the author extends the principle for modelling of the growth of wealth...
On the finite termination of the damped-Newton algorithm for linear complementarity problem
On the finite termination of the damped-Newton algorithm for linear complementarity problem
1998,
Harker and Pang proposed the following open question: whether or not the damped-Newton...
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,...
On-line capacitated single machine scheduling and its heuristics
On-line capacitated single machine scheduling and its heuristics
1998,
Capacitated single machine scheduling (CSMS) problem is a variant of the classical...
(g, f)-factorizations of graphs orthogonal to [1,2]-subgraph
(g, f)-factorizations of graphs orthogonal to [1,2]-subgraph
1997,
Let G be a simple graph. Let g ( x ) and f ( x ) be integer-valued functions defined...
A graph partition problem
A graph partition problem
1996,
This paper shows a graph partition problem to be polynomially solvable. Moreover, the...
The diameters of almost all Cayley digraphs
The diameters of almost all Cayley digraphs
1997,
Let G be a finite group of order n and S be a subset of G not containing the identity...
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 ,...
Papers per page: