Authentication email has already been sent, please check your email box: and activate it as soon as possible.
You can login to My Profile and manage your email alerts.
If you haven’t received the email, please:
|
|
There are 5 papers published in subject: > since this site started. |
Results per page: |
Select Subject |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
1. A Nonmonotonic Self-Adaptive Trust Region Algorithm Without Line Search | |||
Hang Dan,Zhou Qunyan | |||
Mathematics 01 October 2013 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In this paper,we propose a nonmonotone trust region method for unconstrained optimization.Our method can be regarded as a combination of nonmonotone technique ,fixed steplength and self-adaptive trust region,when a trial step is not accepted ,the method doesn't resolve the subproblem but generates a iterative point whose steplength is defined by formula. Under mild conditions,we prove that the algorithm is global convergence and superlinear convergence. Numerical results are also presented. | |||
TO cite this article:Hang Dan,Zhou Qunyan. A Nonmonotonic Self-Adaptive Trust Region Algorithm Without Line Search[OL].[ 1 October 2013] http://en.paper.edu.cn/en_releasepaper/content/4562233 |
2. A Combined Homotopy Method for Solving Horizontal Linear | |||
JUNYAN XU,ZHUANG MIAO,QINGHUAI LIU | |||
Mathematics 20 April 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:A global convergence combined homotopy method for solving horizontal linear complementarity problem has been introduced in this paper. We give the combined homotopy equation and prove in details the existence of the smooth path from almost any interior initial point to a solution of HLCP ( , , ). We give several preliminary numerical results. Numerical results are presented to show the effectiveness of this method. | |||
TO cite this article:JUNYAN XU,ZHUANG MIAO,QINGHUAI LIU. A Combined Homotopy Method for Solving Horizontal Linear[OL].[20 April 2009] http://en.paper.edu.cn/en_releasepaper/content/31550 |
3. A New Online Algorithm for Multiclass of SVM | |||
zhang leilei,Sheng Baohuai | |||
Mathematics 25 March 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In the present paper we provide a new algorithm for muticlass vector machines. Our starting point is a generalized notion of the maximal margin to multiclass problems. Using this notion we cast the muticlass problem as a binary classification task every time. So we combine a new classification function with the approximate maximal margin algorithm which is devised for binary classification.Our algorithm needs O( (p−1) α2γ2 ) corrections every time to separate the data with p-norm margin larger than l(1 − α)γ, with γ being the p-norm margin of the data. | |||
TO cite this article:zhang leilei,Sheng Baohuai. A New Online Algorithm for Multiclass of SVM[OL].[25 March 2009] http://en.paper.edu.cn/en_releasepaper/content/30712 |
4. Energy change of Bipartite unicyclic graph with k | |||
chen zhiwen | |||
Mathematics 19 March 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:G is a (molecular)graph,its energy ,denoted by E(G),is definedto be the absolute values of all eigenvalues of adjacency matrix of G.Let ɡ2l,r,k1,k2 (k1 ≥k2≥ 0) the graph obtained by attaching k1 And k2 pendent edges to the first vertex and the r-th vertex of the cycle Cl,respectively.Wecharacterized energy change and the extremalenergy graphs in ɡ2l,r,k1,k2 (k1 ≥k2≥ 0). | |||
TO cite this article:chen zhiwen. Energy change of Bipartite unicyclic graph with k[OL].[19 March 2009] http://en.paper.edu.cn/en_releasepaper/content/30509 |
5. Solution of a Class of Minimal Surface Problem with Obstacle | |||
Liu Kefei,Li Shangzhi,Wang Min | |||
Mathematics 29 August 2008 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Plateau’s problem is to determine the surface with minimal area that lies above an obstacle with given boundary conditions. In this paper, a special example of this class of the problem is given and solved with the linear finite element method. First, we triangulate the domain of definition, and transform the linear finite element approximation into a constrained nonlinear optimization problem. Then we introduce a simple and efficient method, named sequential quadratic programming, for solving the constrained nonlinear optimization problem. The sequential quadratic programming is implemented by the fmincon function in the optimization toolbox of MATLAB. Also, we discuss the relations between the number of grids and the computing time as well as the precision of the result. | |||
TO cite this article:Liu Kefei,Li Shangzhi,Wang Min. Solution of a Class of Minimal Surface Problem with Obstacle[OL].[29 August 2008] http://en.paper.edu.cn/en_releasepaper/content/23631 |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
|
Results per page: |
About Sciencepaper Online | Privacy Policy | Terms & Conditions | Contact Us
© 2003-2012 Sciencepaper Online. unless otherwise stated