Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Country: China
Found
1356 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
A sub-quadratic programming feasible method for nonlinear programming
1995,
Wu F.
In this paper, a one-step superlinearly convergent feasible algorithm for nonlinear...
Global convergence of a class of new trust region algorithm
1995,
Han J.Y.
In this paper, the authors propose a class of nonmonotone trust region algorithms for...
A generalized gradient projection method for optimization problems with equality and inequality constraints about arbitrary initial point
1996,
Gao Z.Y.
In this paper, the authors give a new generalized gradient projection algorithm for...
On the minimum distance determined by n(≤7) points in an isosceles right triangle
1996,
Xu Y.
Let T denote a finite set of points in a unit isosceles right triangle (i.e., the...
On the convergence of multiplicative iterative algorithms with inexact line search
1997,
Yang X.G.
This paper studies the convergence properties of the multiplicative algorithm with...
Unconstrained methods for generalized nonlinear complementarity and variational inequality problems
1996,
Peng J.M.
In this paper, the author constructs unconstrained methods for the generalized...
A class of factorized quasi-Newton methods for nonlinear least squares problems
1996,
Xu C.X.
This paper gives a class of descent methods of nonlinear least squares solution. A...
A restricted trust region method with supermemory for unconstrained optimization
1996,
Sun L.P.
A new method for unconstrained optimization problems is presented. It belongs to the...
A column recurrence algorithm for solving linear least squares problem
1996,
Zhao J.X.
A new column recurrence algorithm based on the classical Greville method and modified...
Global efficiency in multiobjective optimization
1995,
Wang S.Y.
In this short technical note, the authors present five sufficient conditions to...
A modified constrained variable metric algorithm using l1-penalty function as merit function
1996,
Zhang K.C.
In this paper, the authors propose a new method which modifies the variable metric...
A class of superlinearly convergent projection quasi-Newton algorithms
1996,
Lai Y.L.
In this paper, the authors give a class of algorithms containing two parameters for...
Global convergence of the Broyden's family with a class of inexact linesearches
1996,
Liu G.H.
In this paper, the restricted Broyden's family is investigated. A class of Wolfe-type...
An analysis on the coherent function method
1996,
Yang Q.Z.
This paper gives a strict analysis in theory and computation on the coherent function...
A class of global convergent conjugate projection gradient methods and its superlinear convergence rate
1996,
Zhi Z.J.
In this paper, a class of global convergent conjugate projection gradient methods...
On the convergence of conjugate gradient methods invariant to nonlinear scaling
1996,
Li Z.F.
In order to construct more efficient methods for unconstrained optimization problems,...
A generalized gradient method for nonlinear constraints and its convergent properties
1996,
Gao Z.Y.
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
1996,
Liu G.H.
The Davidon–Fletcher–Powell (DFP) algorithm is one of the most famous...
Symmetric duality for a class of multiobjective fractional programming
1997,
Yang X.M.
A pair of symmetric duals for a class of nondifferentiable multiobjective fractional...
A logarithmic barrier Newton method for semidefinite programming
1997,
Jiang J.M.
In this paper, by analyzing the properties of the central path, the authors give a...
Optimality conditions for nonconvex bilevel programming problems
1997,
Han J.Y.
In this paper, the authors derive an exact penalty function for nonconvex bilevel...
The convergence of Broyden algorithms without convexity assumption
1997,
Pu D.G.
In this paper, the author discusses the convergence of the Broyden algorithms without...
Interior ellipsoid method for convex quadratic programming
1996,
Wu F.
In this paper, a new variant of the interior ellipsoid method for convex quadratic...
Direct ellipsoid method for convex quadratic program
1996,
Wu S.Q.
This paper shows how to apply the ellipsoid method directly to the convex quadratic...
First Page
54
55
56
57
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers