default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDConstantin Zalinescu
Person information
- affiliation: University Alexandru Ioan Cuza, Romania
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j26]Constantin Zalinescu
:
On canonical duality theory and constrained optimization problems. J. Glob. Optim. 82(4): 1053-1070 (2022)- 2021
- [j25]Vicente Novo, Constantin Zalinescu:
On Relatively Solid Convex Cones in Real Linear Spaces. J. Optim. Theory Appl. 188(1): 277-290 (2021) - 2020
- [j24]Constantin Zalinescu:
On quadratically constrained quadratic optimization problems and canonical duality theory. Optim. Lett. 14(8): 2227-2245 (2020)
2010 – 2019
- 2019
- [c1]Constantin Zalinescu:
On Constrained Optimization Problems Solved Using the Canonical Duality Theory. WCGO 2019: 155-163 - 2016
- [j23]Constantin Zalinescu:
On Second-Order Generalized Convexity. J. Optim. Theory Appl. 168(3): 802-829 (2016) - [j22]Constantin Zalinescu:
On V. Latorre and D.Y. Gao's paper "Canonical duality for solving general nonconvex constrained problems". Optim. Lett. 10(8): 1781-1787 (2016) - 2015
- [b1]Akhtar A. Khan, Christiane Tammer, Constantin Zalinescu:
Set-valued Optimization - An Introduction with Applications. Vector Optimization, Springer 2015, ISBN 978-3-642-54264-0, pp. i-xxii, 1-765 - 2014
- [j21]Constantin Zalinescu:
A Critical View on Invexity. J. Optim. Theory Appl. 162(3): 695-704 (2014) - 2013
- [j20]Constantin Zalinescu:
On the differentiability of the support function. J. Glob. Optim. 57(3): 719-731 (2013) - [j19]M. D. Voisei, Constantin Zalinescu:
Counterexamples to a triality theorem for quadratic-exponential minimization problems. Math. Methods Oper. Res. 77(2): 227-237 (2013) - 2012
- [j18]Constantin Zalinescu:
On duality gap in linear conic problems. Optim. Lett. 6(3): 393-402 (2012) - 2011
- [j17]M. D. Voisei, Constantin Zalinescu:
Counterexamples to a triality theorem in "Canonical dual least square method". Comput. Optim. Appl. 50(3): 619-628 (2011) - [j16]M. D. Voisei, Constantin Zalinescu:
Counterexamples to some triality and tri-duality results. J. Glob. Optim. 49(1): 173-183 (2011) - 2010
- [j15]Constantin Zalinescu:
On the duality between the profit and the indirect distance functions in production theory. Eur. J. Oper. Res. 207(1): 30-36 (2010) - [j14]M. D. Voisei, Constantin Zalinescu:
Maximal monotonicity criteria for the composition and the sum under weak interiority conditions. Math. Program. 123(1): 265-283 (2010)
2000 – 2009
- 2009
- [j13]Jean-Paul Penot, Constantin Zalinescu:
Convex analysis can be helpful for the asymptotic analysis of monotone operators. Math. Program. 116(1-2): 481-498 (2009) - 2008
- [j12]Constantin Zalinescu:
On the second conjugate of several convex functions in general normed vector spaces. J. Glob. Optim. 40(1-3): 475-487 (2008) - [j11]Constantin Zalinescu:
Hahn-Banach extension theorems for multifunctions revisited. Math. Methods Oper. Res. 68(3): 493-508 (2008) - [j10]Constantin Zalinescu:
On Zero Duality Gap and the Farkas Lemma for Conic Programming. Math. Oper. Res. 33(4): 991-1001 (2008) - [j9]Abderrahim Hantoute, Marco A. López, Constantin Zalinescu:
Subdifferential Calculus Rules in Convex Analysis: A Unifying Approach Via Pointwise Supremum Functions. SIAM J. Optim. 19(2): 863-882 (2008) - 2006
- [j8]Constantin Zalinescu:
On the Maximization of (not necessarily) Convex Functions on Convex Sets. J. Glob. Optim. 36(3): 379-389 (2006) - 2003
- [j7]Constantin Zalinescu:
A Nonlinear Extension of Hoffman's Error Bounds for Linear Inequalities. Math. Oper. Res. 28(3): 524-532 (2003) - [j6]Constantin Zalinescu:
Sharp Estimates for Hoffman's Constant for Systems of Linear Inequalities and Equalities. SIAM J. Optim. 14(2): 517-533 (2003)
1990 – 1999
- 1997
- [j5]Jean-Pierre Crouzeix, Jacques A. Ferland, Constantin Zalinescu:
α-Covex Sets and Strong Quasiconvexity. Math. Oper. Res. 22(4): 998-1022 (1997) - 1992
- [j4]Constantin Zalinescu:
A note on d-stability of convex programs and limiting Lagrangians. Math. Program. 53: 267-277 (1992) - 1991
- [j3]Constantin Zalinescu:
A result on sets, with applications to vector optimization. ZOR Methods Model. Oper. Res. 35(4): 291-298 (1991)
1980 – 1989
- 1987
- [j2]Constantin Zalinescu:
Solvability results for sublinear functions and operators. Z. Oper. Research 31(3) (1987) - 1986
- [j1]Constantin Zalinescu:
Letter To The Editor: On Borwein's Paper, "Adjoint Process Duality". Math. Oper. Res. 11(4): 692-698 (1986)
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 2025-01-20 23:01 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:
