default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDX. X. Huang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j29]X. X. Huang, Y. P. Fang, X. Q. Yang:
Characterizing the Nonemptiness and Compactness of the Solution Set of a Vector Variational Inequality by Scalarization. J. Optim. Theory Appl. 162(2): 548-558 (2014)- [j28]Jia Zhai, X. X. Huang:
Calmness and Exact Penalization in Vector Optimization under Nonlinear Perturbations. J. Optim. Theory Appl. 162(3): 856-872 (2014) - 2013
- [j27]X. X. Huang, Jen-Chih Yao:
Characterizations of the nonemptiness and compactness for solution sets of convex set-valued optimization problems. J. Glob. Optim. 55(3): 611-626 (2013) - [j26]X. X. Huang:
Convergence of a class of penalty methods for constrained scalar set-valued optimization. J. Glob. Optim. 56(4): 1501-1513 (2013) - 2012
- [j25]H. L. Luo, X. X. Huang, J. W. Peng:
Generalized weak sharp minima in cone-constrained convex optimization with applications. Comput. Optim. Appl. 53(3): 807-821 (2012) - [j24]G. Wang, X. X. Huang:
Levitin-Polyak Well-Posedness for Optimization Problems with Generalized Equilibrium Constraints. J. Optim. Theory Appl. 153(1): 27-41 (2012) - [j23]X. X. Huang:
Calmness and Exact Penalization in Constrained Scalar Set-Valued Optimization. J. Optim. Theory Appl. 154(1): 108-119 (2012)
2000 – 2009
- 2009
- [j22]X. X. Huang, X. Q. Yang, D. L. Zhu:
Levitin-Polyak well-posedness of variational inequality problems with functional constraints. J. Glob. Optim. 44(2): 159-174 (2009) - 2008
- [j21]Zui Xu, D. L. Zhu, X. X. Huang:
Levitin-Polyak well-posedness in generalized vector variational inequality problem with functional constraints. Math. Methods Oper. Res. 67(3): 505-524 (2008) - 2007
- [j20]X. X. Huang, X. Q. Yang:
Levitin-Polyak well-posedness of constrained vector optimization problems. J. Glob. Optim. 37(2): 287-304 (2007) - 2006
- [j19]X. X. Huang, Kok Lay Teo, X. Q. Yang:
Calmness and Exact Penalization in Vector Optimization with Cone Constraints. Comput. Optim. Appl. 35(1): 47-67 (2006) - [j18]X. X. Huang, X. Q. Yang, Kok Lay Teo:
Partial Augmented Lagrangian Method and Mathematical Programs with Complementarity Constraints. J. Glob. Optim. 35(2): 235-254 (2006) - [j17]X. X. Huang, X. Q. Yang, Kok Lay Teo:
Convergence Analysis of a Class of Penalty Methods for Vector Optimization Problems with Cone Constraints. J. Glob. Optim. 36(4): 637-652 (2006) - [j16]X. X. Huang, X. Q. Yang:
Generalized Levitin--Polyak Well-Posedness in Constrained Optimization. SIAM J. Optim. 17(1): 243-258 (2006) - 2005
- [j15]X. X. Huang, X. Q. Yang:
Further Study on Augmented Lagrangian Duality Theory. J. Glob. Optim. 31(2): 193-210 (2005) - 2004
- [j14]X. Q. Yang, X. X. Huang:
Lower-order penalty methods for mathematical programs with complementarity constraints. Optim. Methods Softw. 19(6): 693-720 (2004) - 2003
- [j13]X. Q. Yang, X. X. Huang:
Partially Strictly Monotone and Nonlinear Penalty Functions for Constrained Mathematical Programs. Comput. Optim. Appl. 25(1-3): 293-311 (2003) - 2002
- [j12]X. X. Huang, X. Q. Yang:
On Characterizations of Proper Efficiency for Nonconvex Multiobjective Optimization. J. Glob. Optim. 23(3-4): 213-231 (2002) - [j11]X. X. Huang, X. Q. Yang:
Nonlinear Lagrangian for Multiobjective Optimization and Applications to Duality and Exact Penalization. SIAM J. Optim. 13(3): 675-692 (2002) - 2001
- [j10]X. X. Huang, X. Q. Yang:
Approximate Optimal Solutions and Nonlinear Lagrangian Functions. J. Glob. Optim. 21(1): 51-65 (2001) - [j9]X. X. Huang:
Extended and strongly extended well-posedness of set-valued optimization problems. Math. Methods Oper. Res. 53(1): 101-116 (2001) - [j8]X. X. Huang, Xinmin Yang:
Some existence results of efficiency in vector optimization. Math. Methods Oper. Res. 53(3): 391-401 (2001) - [j7]X. Q. Yang, X. X. Huang:
A Nonlinear Lagrangian Approach to Constrained Optimization Problems. SIAM J. Optim. 11(4): 1119-1144 (2001) - 2000
- [j6]X. X. Huang:
Equivalents of a general approximate variational principle for set-valued maps and application to efficiency. Math. Methods Oper. Res. 51(3): 433-442 (2000) - [j5]X. X. Huang:
Stability in vector-valued and set-valued optimization. Math. Methods Oper. Res. 52(2): 185-193 (2000)
1990 – 1999
- 1999
- [j4]Guang-Ya Chen, X. X. Huang, Gue Myung Lee:
Equivalents of an approximate variational principle for vector-valued functions and applications. Math. Methods Oper. Res. 49(1): 125-136 (1999) - 1998
- [j3]Guang-Ya Chen, X. X. Huang:
Stability results for Ekeland's e variational principle for vector valued functions. Math. Methods Oper. Res. 48(1): 97-103 (1998) - [j2]Guang-Ya Chen, X. X. Huang:
Ekeland's ε-variational principle for set-valued mappings. Math. Methods Oper. Res. 48(2): 181-186 (1998) - [j1]G. Y. Chen, X. X. Huang:
A unified approach to the existing three types of variational principles for vector valued functions. Math. Methods Oper. Res. 48(3): 349-357 (1998)
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:16 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:
