Journal: Acta Mathematicae Applicatae Sinica

Found 40 papers in total
A robust superlinearly convergent algorithm for linearly constrained optimization problems under degeneracy
A robust superlinearly convergent algorithm for linearly constrained optimization problems under degeneracy
1998,
In this paper, the problem of minimizing a convex function subject to general linear...
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...
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...
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...
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...
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...
A sub-quadratic programming feasible method for nonlinear programming
A sub-quadratic programming feasible method for nonlinear programming
1995,
In this paper, a one-step superlinearly convergent feasible algorithm for nonlinear...
Global convergence of a class of new trust region algorithm
Global convergence of a class of new trust region algorithm
1995,
In this paper, the authors propose a class of nonmonotone trust region algorithms for...
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...
New algorithms for linear programming
New algorithms for linear programming
1992,
The problem of solving a linear programming is converted into that of solving an...
Computation of a trust region step
Computation of a trust region step
1991,
The most time consuming work of the trust region method for unconstrained minimization...
A new algorithm for a class of reverse convex programmings
A new algorithm for a class of reverse convex programmings
1992,
In this paper, a new algorithm for the reverse convex programming which linear object...
A fast real-time algorithm for constructing convex hulls in higher dimensions
A fast real-time algorithm for constructing convex hulls in higher dimensions
1992,
This paper gives a simple description that a convex polytope of d- dimension is...
A perturbed successive quadratic programming algorithm and its convergence
A perturbed successive quadratic programming algorithm and its convergence
1990,
In this paper, a successive quadratic programming algorithm for solving a nonlinear...
Papers per page: