default search action
Xiaoni Chi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j9]Qiuxuan Wu
, Zikai Zhao, Mingming Chen, Xiaoni Chi, Botao Zhang, Jian Wang, Anton A. Zhilenkov, Sergey A. Chepinskiy:
An RNA evolutionary algorithm based on gradient descent for function optimization. J. Comput. Des. Eng. 11(4): 332-357 (2024) - [j8]Xiaoni Chi
Kernel-Based Full-Newton Step Feasible Interior-Point Algorithm for P*(κ )-Weighted Linear Complementarity Problem. J. Optim. Theory Appl. 202(1): 108-132 (2024) - 2021
- [j7]Zijun Hao, Zhongping Wan, Xiaoni Chi
Generalized lower-order penalty algorithm for solving second-order cone mixed complementarity problems. J. Comput. Appl. Math. 385: 113168 (2021) - [j6]Xiaoni Chi
A Full-Newton Step Infeasible Interior-Point Method for the Special Weighted Linear Complementarity Problem. J. Optim. Theory Appl. 190(1): 108-129 (2021) - [c9]Lifeng Zhang, Qiuxuan Wu, Xiaoni Chi, Jian Wang, Botao Zhang, Weijie Lin, Sergey A. Chepinskiy, Anton A. Zhilenkov, Yanbin Luo, Farong Gao
RNA genetic algorithm based on octopus learning mechanism. RCAR 2021: 1029-1034 - 2020
- [j5]Qiuxuan Wu
Quantifying Analysis of the Impact of Haze on Photovoltaic Power Generation. IEEE Access 8: 215977-215986 (2020)
2010 – 2019
- 2019
- [j4]Xiaoni Chi
The weighted horizontal linear complementarity problem on a Euclidean Jordan algebra. J. Glob. Optim. 73(1): 153-169 (2019) - 2015
- [j3]Zijun Hao, Zhongping Wan, Xiaoni Chi
A power penalty method for second-order cone nonlinear complementarity problems. J. Comput. Appl. Math. 290: 136-149 (2015) - [j2]Zijun Hao
A power penalty method for second-order cone linear complementarity problems. Oper. Res. Lett. 43(2): 137-142 (2015) - 2013
- [j1]Xiaoni Chi
A Two-Parametric Class of Merit Functions for the Second-Order Cone Complementarity Problem. J. Appl. Math. 2013: 571927:1-571927:10 (2013) - 2012
- [c8]Xiaoni Chi, Suobin Zhang:
An inexact non-interior continuation method for symmetric cone complementarity problems. FSKD 2012: 2883-2886 - [c7]Xiaoni Chi, Bichuan Liu, Qi Niu, Qiuxuan Wu:
Web Load Balance and Cache Optimization Design Based Nginx under High-Concurrency Environment. ICDMA 2012: 1029-1032 - 2011
- [c6]Xiaoni Chi
A Nonmonotone Smoothing Algorithm for Second-Order Cone Programming in Failure Criteria. CSISE (1) 2011: 179-184 - [c5]Qiuxuan Wu, Yanbin Luo, Xiaoni Chi, Xiaochun Lou:
Motion error analysis of modular self-reconfigurable robot M-Cubes based screw theory. EMEIT 2011: 859-866 - [c4]Xiaoni Chi, Qing Zhang:
A nonmonotone smoothing algorithm for symmetric conic linear programming. FSKD 2011: 1423-1426 - 2010
- [c3]Xiaoni Chi, Wenlue Chen:
A predictor-corrector smoothing method for symmetric conic linear programming. FSKD 2010: 1961-1965
2000 – 2009
- 2009
- [c2]Xiaoni Chi, Ping Li:
A Globally Convergent Smoothing Method for Symmetric Conic Linear Programming. ISICA 2009: 136-143 - [c1]Xiaoni Chi, Jin Peng
A Combined Newton Method for Second-Order Cone Programming. ISNN (4) 2009: 605-612
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-09-21 23:33 CEST 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: