Select Subject

All (8831)

Agronomy (158)

Animal Husbandry,... (64)

Aquatic Science (16)

Astronomy (36)

Aviation (22)

Basic Medicine (184)

Biology (504)

Chemical Engineering (103)

Chemistry (635)

Civil and Archite... (105)

Clinical Medicine (236)

Computer Science ... (924)

Dynamic and Elect... (121)

Earth Science (119)

Economics (67)

Education (31)

Electrics, Commun... (927)

Energy Science an... (67)

Engineering and T... (15)

Environmental Sci... (140)

Food Science and ... (63)

Forestry (36)

Hydraulic Enginee... (40)

Mechanics (240)

Metallurgical Eng... (32)

Mine Engineering ... (38)

Nuclear Science a... (21)

Pharmacy (98)

Physics (920)

Preventive Medici... (37)

Psychology (20)

Security Science ... (17)

Sports Science (6)

Surveying and Map... (15)

Textile Science a... (16)

Traditional Chine... (56)

Transportation En... (57)

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. Convergence Analysis on a Derivative-Free Descent Method for Nonlinear Complementarity Problems
	Wei-Zhe Gu,Li-Yong Lu
	Mathematics 17 June 2016
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Recently, Hu, Huang and Chen, in the paper[Properties of a family of generalized NCP-functions and a derivative free algorithm for complementarity problems] introduced a family of generalized NCP-functions, which include many existing NCP-functions as special cases. They obtained several favorite properties of the functions; and by which, they showed that a derivative-free descent method is globally convergent under suitable assumptions. However, no result on convergent rate of the method was reported. In this paper, we further investigate some properties of this family of generalized NCP-functions. In particular, we show that, under suitable assumptions, the iterative sequence generated by the descent method discussed in their paper converges globally at a linear rate to a solution of the nonlinear complementarity problem.
	TO cite this article:Wei-Zhe Gu,Li-Yong Lu. Convergence Analysis on a Derivative-Free Descent Method for Nonlinear Complementarity Problems[OL].[17 June 2016] http://en.paper.edu.cn/en_releasepaper/content/4697495


	2. Multivariate spectral gradient projection method for large-scale nonlinear systems ofmonotone equations
	YU Gaohang,NIU Shanzhou
	Mathematics 11 January 2012
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract: In this paper, we propose a multivariate spectral gradient method for solving la- rge-scalenonlinear systems of monotone equations. Under some suitable conditions, we showthat the method is globally convergent. Some favorable properties of the proposed methodin- clude the following cases: (1) the global convergence is independent of any merit function;(2) it can be applied to solving nonsmooth equations;(3) the global convergence theorem is esta- blished without Lipschitz continuity anddifferentiability on the equation. The preliminary n- umerical results show that the proposedmethod is practically effective.
	TO cite this article:YU Gaohang,NIU Shanzhou. Multivariate spectral gradient projection method for large-scale nonlinear systems ofmonotone equations[OL].[11 January 2012] http://en.paper.edu.cn/en_releasepaper/content/4460684


	3. Stochastic Multiobjective Problems with Equilibrium Constraints
	Lin Guihua
	Mathematics 09 February 2011
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:In this paper, we consider stochastic multiobjective problems with equilibrium constraints. Several Pareto stationarities concepts are presented. We reformulate the Pareto stationarity conditions to mixed complementarity problems. Asymptotic methods and applications are described for the SMOPCC.
	TO cite this article:Lin Guihua. Stochastic Multiobjective Problems with Equilibrium Constraints[OL].[ 9 February 2011] http://en.paper.edu.cn/en_releasepaper/content/4410399


	4. A Aggregate Constraint Shifting Combined Homotopy Method
	Wang Xiuyu,Jiang Xingwu,Liu Qinghuai
	Mathematics 16 January 2009
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:For solving nonlinear nonconvex programming problem with one convex constraint.First, We use non-convex constraint structure aggregate function，and then we construct constraint shifting function and combined homotopy equation, under the conditions of the feasible set bounded connected and the regularity of boundary. Convergence of a smooth homotopy path that from any interior point or any infeasible interior point to a solution of the problem is prove. Numerical examples concluded that this method is feasible and effective
	TO cite this article:Wang Xiuyu,Jiang Xingwu,Liu Qinghuai. A Aggregate Constraint Shifting Combined Homotopy Method [OL].[16 January 2009] http://en.paper.edu.cn/en_releasepaper/content/28002

Select/Unselect all

For Selected Papers

Saved Papers

Please enter a name for this paper to be shown in your personalized Saved Papers list

Rank

Alert Name:
Alerting to:
Authentication email will be sent to your email address in 24 hours
Frequency:
Email Message Format:	Plain text Graphical(HTML)

Complete the form below and we will recommend the selected titles to your friends on your behalf. * Indicates a required field.
Your name*:
Your email address*:
Recipient's name*:
Recipient's email address*:
(multiple recipient's names and email addresses should be separated with semicolons)
Your comments:	I thought you would find the page(s) useful.

Your name:
Your email address:
Recipient's name:
Recipient's email address:
(multiple recipient's names and email addresses should be separated with semicolons)
Your comments:	I thought you would find this page useful.

Disclaimer: This message was sent to your friend using the "Send it to a friend" facility on the Sciencepaper Online’ WWW site, http://www.paper.edu.cn/en. The Sciencepaper Online is not responsible for the content of this email, and anything said in this email does not necessarily reflect the Sciencepaper Online's views.

	Check out RSS, or use RSS reader to subscribe this item