default search action
Jinchuan Zhou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j30]Jingyong Tang, Jinchuan Zhou:
Expected Residual Minimization Formulation for Stochastic Absolute Value Equations. J. Optim. Theory Appl. 203(1): 651-675 (2024) - 2023
- [j29]Jingyong Tang
, Jinchuan Zhou, Zhongfeng Sun
A derivative-free line search technique for Broyden-like method with applications to NCP, wLCP and SI. Ann. Oper. Res. 321(1): 541-564 (2023) - [j28]Jingyong Tang, Jinchuan Zhou, Hongchao Zhang:
An Accelerated Smoothing Newton Method with Cubic Convergence for Weighted Complementarity Problems. J. Optim. Theory Appl. 196(2): 641-665 (2023) - [j27]Matus Benko, Helmut Gfrerer
Second-Order Optimality Conditions for General Nonconvex Optimization Problems and Variational Analysis of Disjunctive Systems. SIAM J. Optim. 33(4): 2625-2653 (2023) - 2022
- [j26]Helmut Gfrerer
Second-Order Optimality Conditions for Nonconvex Set-Constrained Optimization Problems. Math. Oper. Res. 47(3): 2344-2365 (2022) - [j25]Jingyong Tang, Jinchuan Zhou:
A modified damped Gauss-Newton method for non-monotone weighted linear complementarity problems. Optim. Methods Softw. 37(3): 1145-1164 (2022) - 2021
- [j24]Jingyong Tang, Jinchuan Zhou:
Quadratic convergence analysis of a nonmonotone Levenberg-Marquardt type method for the weighted nonlinear complementarity problem. Comput. Optim. Appl. 80(1): 213-244 (2021) - [j23]Jingyong Tang, Jinchuan Zhou:
A smoothing quasi-Newton method for solving general second-order cone complementarity problems. J. Glob. Optim. 80(2): 415-438 (2021) - 2020
- [j22]Jingyong Tang
Smoothing inexact Newton method based on a new derivative-free nonmonotone line search for the NCP over circular cones. Ann. Oper. Res. 295(2): 787-808 (2020)
2010 – 2019
- 2019
- [j21]Xide Zhu
Mathematical Programs with Second-Order Cone Complementarity Constraints: Strong Stationarity and Approximation Method. J. Optim. Theory Appl. 181(2): 521-540 (2019) - [j20]Jingyong Tang, Jinchuan Zhou:
A quadratically convergent descent method for the absolute value equation Ax+B|x|=b. Oper. Res. Lett. 47(4): 229-234 (2019) - [j19]Jein-Shan Chen
Exact Formula for the Second-Order Tangent Set of the Second-Order Cone Complementarity Set. SIAM J. Optim. 29(4): 2986-3011 (2019) - 2018
- [j18]Jane J. Ye
Verifiable sufficient conditions for the error bound property of second-order cone complementarity problems. Math. Program. 171(1-2): 361-395 (2018) - [j17]Jingyong Tang, Jinchuan Zhou, Liang Fang:
Strong convergence properties of a modified nonmonotone smoothing algorithm for the SCCP. Optim. Lett. 12(2): 411-424 (2018) - 2017
- [j16]Jinchuan Zhou, Jingyong Tang, Jein-Shan Chen
Parabolic Second-Order Directional Differentiability in the Hadamard Sense of the Vector-Valued Functions Associated with Circular Cones. J. Optim. Theory Appl. 172(3): 802-823 (2017) - [j15]Jane J. Ye
Exact formulas for the proximal/regular/limiting normal cone of the second-order cone complementarity set. Math. Program. 162(1-2): 33-50 (2017) - 2016
- [j14]Xiaoqi Yang
Optimality Conditions for Semi-Infinite and Generalized Semi-Infinite Programs Via Lower Order Exact Penalty Functions. J. Optim. Theory Appl. 169(3): 984-1012 (2016) - [j13]Jane J. Ye
First-Order Optimality Conditions for Mathematical Programs with Second-Order Cone Complementarity Constraints. SIAM J. Optim. 26(4): 2820-2846 (2016) - 2015
- [j12]Jingyong Tang, Jinchuan Zhou, Liang Fang:
A non-monotone regularization Newton method for the second-order cone complementarity problem. Appl. Math. Comput. 271: 743-756 (2015) - [j11]Jinchuan Zhou, Jein-Shan Chen:
On the existence of saddle points for nonlinear second-order cone programming problems. J. Glob. Optim. 62(3): 459-480 (2015) - [j10]Jinchuan Zhou, Yu-Lin Chang
The H-differentiability and calmness of circular cone functions. J. Glob. Optim. 63(4): 811-833 (2015) - 2014
- [j9]Jingyong Tang, Li Dong, Jinchuan Zhou, Liang Fang:
A new non-interior continuation method for solving the second-order cone complementarity problem. Appl. Math. Comput. 236: 287-299 (2014) - [j8]Changyu Wang, Cheng Ma, Jinchuan Zhou:
A new class of exact penalty functions and penalty algorithms. J. Glob. Optim. 58(1): 51-73 (2014) - [j7]Yu Ying Zhou, Jinchuan Zhou, Xiaoqi Yang
Existence of augmented Lagrange multipliers for cone constrained optimization problems. J. Glob. Optim. 58(2): 243-260 (2014) - [j6]Jingyong Tang, Li Dong, Liang Fang, Jinchuan Zhou:
Smoothing Newton algorithm for the second-order cone programming with a nonmonotone line search. Optim. Lett. 8(5): 1753-1771 (2014) - 2013
- [j5]Changyu Wang, Wenling Zhao, Jinchuan Zhou, Shujun Lian:
Global convergence and finite termination of a class of smooth penalty function algorithms. Optim. Methods Softw. 28(1): 1-25 (2013) - 2012
- [j4]Xunzhi Zhu, Jinchuan Zhou, Lili Pan
Generalized Quadratic Augmented Lagrangian Methods with Nonmonotone Penalty Parameters. J. Appl. Math. 2012: 181629:1-181629:15 (2012) - [j3]Jinchuan Zhou, Naihua Xiu, Changyu Wang:
Saddle point and exact penalty representation for generalized proximal Lagrangians. J. Glob. Optim. 54(4): 669-687 (2012) - [j2]Jinchuan Zhou, Changyu Wang:
New characterizations of weak sharp minima. Optim. Lett. 6(8): 1773-1785 (2012)
2000 – 2009
- 2008
- [j1]Jinchuan Zhou, Changyu Wang:
A note on finite termination of iterative algorithms in mathematical programming. Oper. Res. Lett. 36(6): 715-717 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 20:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: