default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDingguo Pu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2017
[j10]Hua Wang, Fuyao Liu, Chao Gu, Dingguo Pu:
An infeasible active-set QP-free algorithm for general nonlinear programming. Int. J. Comput. Math. 94(5): 884-901 (2017)- 2015
- [j9]Mingxia Huang, Dingguo Pu:
A trust-region SQP method without a penalty or a filter for nonlinear programming. J. Comput. Appl. Math. 281: 107-119 (2015) - 2014
- [j8]Ailan Liu, Dingguo Pu:
3-1 Piecewise NCP Function for New Nonmonotone QP-Free Infeasible Method. J. Robotics Mechatronics 26(5): 566-572 (2014) - [j7]Weiai Liu, Chungen Shen, Xiaojing Zhu, Dingguo Pu:
An infeasible QP-free algorithm without a penalty function or a filter for nonlinear inequality-constrained optimization. Optim. Methods Softw. 29(6): 1238-1260 (2014) - 2013
- [j6]Xiaojing Zhu, Dingguo Pu:
A restoration-free filter SQP algorithm for equality constrained optimization. Appl. Math. Comput. 219(11): 6016-6029 (2013) - 2011
- [j5]Chungen Shen, Wenjuan Xue, Dingguo Pu:
An infeasible Ssle Filter Algorithm for General Constrained Optimization without Strict complementarity. Asia Pac. J. Oper. Res. 28(3): 361-399 (2011) - 2010
- [j4]Haodong Yu, Dingguo Pu:
Smoothing Newton method for NCP with the identification of degenerate indices. J. Comput. Appl. Math. 234(12): 3424-3435 (2010) - [j3]Chungen Shen, Wenjuan Xue, Dingguo Pu:
An infeasible nonmonotone SSLE algorithm for nonlinear programming. Math. Methods Oper. Res. 71(1): 103-124 (2010) - 2009
- [j2]Wenjuan Xue, Chungen Shen, Dingguo Pu:
A new non-monotone SQP algorithm for the minimax problem. Int. J. Comput. Math. 86(7): 1149-1159 (2009) - [j1]Chungen Shen, Wenjuan Xue, Dingguo Pu:
A globally convergent trust region multidimensional filter SQP algorithm for nonlinear programming. Int. J. Comput. Math. 86(12): 2201-2217 (2009)
Conference and Workshop Papers
- 2013
- [c7]Bo Wang, Dingguo Pu:
An SQP Algorithm with Flexible Penalty Functions. BIFE 2013: 609-613 - [c6]Ailan Liu, Dingguo Pu:
A Smoothing QP-free Infeasible Method without a Penalty Function and a Filter. BIFE 2013: 614-618 - [c5]Dingguo Pu, Ailan Liu:
The Convergence of Broyden Algorithms without Convexity. BIFE 2013: 623-627 - [c4]Mingxia Huang, Dingguo Pu:
A Sequential Quadratic Programming Method for Nonlinear Programming without a Penalty or a Filter. BIFE 2013: 638-642 - [c3]Dingguo Pu, Pei Yang:
A Class of New Lagrangian Multiplier Methods. BIFE 2013: 647-651 - 2012
- [c2]Dingguo Pu, Youlin Shang:
Primal and Dual Variables for New QP-free Method without a Penalty Function and a Filter. CSO 2012: 289-293 - [c1]Aifen Feng, Cuixia Xu, Dingguo Pu:
New Form of Lagrangian Multiplier Methods. CSO 2012: 302-306
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-04-24 23:12 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:
