default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexey Tret'yakov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Olga Brezhneva, Yuri Evtushenko
, Vlasta Malkova, Alexey Tret'yakov:
Singular Optimization Problems and p-Factor Approach for Their Analysis. OPTIMA 2024: 31-42- 2023
- [j13]Olga Brezhneva, Agnieszka Prusinska, Alexey Tret'yakov:
On the Finite Complexity of Solutions in a Degenerate System of Quadratic Equations: Exact Formula. Entropy 25(8): 1112 (2023) - [c7]Olga Brezhneva, Yuri Evtushenko, Vlasta Malkova, Alexey Tret'yakov:
The pth-Order Karush-Kuhn-Tucker Type Optimality Conditions for Nonregular Inequality Constrained Optimization Problems. OPTIMA 2023: 14-32 - 2022
- [c6]Olga Brezhneva, Yuri Evtushenko, Vlasta Malkova, Alexey Tret'yakov:
Degenerate Equality Constrained Optimization Problems and P-Regularity Theory. OPTIMA 2022: 18-33 - 2021
- [j12]Agnieszka Prusinska, Krzysztof Szkatula, Alexey Tret'yakov:
On the Locally Polynomial Complexity of the Projection-Gradient Method for Solving Piecewise Quadratic Optimisation Problems. Entropy 23(4): 465 (2021) - [j11]Olga Brezhneva, Yuri G. Evtushenko, Alexey Tret'yakov:
New perspective on some classical results in analysis and optimization. Optim. Methods Softw. 36(4): 811-820 (2021) - [c5]Yuri Evtushenko, Vlasta Malkova, Alexey Tret'yakov:
Exit from Singularity. New Optimization Methods and the p-Regularity Theory Applications. OPTIMA 2021: 3-19 - 2020
- [c4]Yuri Evtushenko, Vlasta Malkova, Alexey Tret'yakov:
P-Regularity Theory: Applications to Optimization. OPTIMA 2020: 97-109
2010 – 2019
- 2019
- [j10]Ewa M. Bednarczuk, Agnieszka Prusinska, Alexey Tret'yakov:
Implicit function and tangent cone theorems for singular inclusions and applications to nonlinear programming. Optim. Lett. 13(8): 1745-1755 (2019) - 2017
- [j9]Olga Brezhneva, Alexey Tret'yakov:
When the Karush-Kuhn-Tucker Theorem Fails: Constraint Qualifications and Higher-Order Optimality Conditions for Degenerate Optimization Problems. J. Optim. Theory Appl. 174(2): 367-387 (2017) - [j8]Ewa M. Bednarczuk, Alexey Tret'yakov:
p-regular nonlinearity: tangency at singularity in degenerate optimization problems. Math. Methods Oper. Res. 86(3): 485-500 (2017) - 2012
- [j7]Olga Brezhneva, Alexey Tret'yakov, Stephen E. Wright:
A short elementary proof of the Lagrange multiplier theorem. Optim. Lett. 6(8): 1597-1601 (2012) - 2011
- [c3]Agnieszka Prusinska, Ewa Szczepanik, Alexey Tret'yakov:
p-th Order Optimality Conditions for Singular Lagrange Problem in Calculus of Variations. Elements of p-Regularity Theory. System Modelling and Optimization 2011: 528-537 - 2010
- [j6]Olga Brezhneva, Alexey Tret'yakov:
Corrigendum: Optimality Conditions for Degenerate Extremum Problems with Equality Constraints. SIAM J. Control. Optim. 48(5): 3670-3673 (2010)
2000 – 2009
- 2009
- [j5]Alexey Tret'yakov, E. E. Tyrtyshnikov:
Optimal in-place transposition of rectangular matrices. J. Complex. 25(4): 377-384 (2009) - [j4]Olga Brezhneva, Alexey Tret'yakov, Stephen E. Wright:
A simple and elementary proof of the Karush-Kuhn-Tucker theorem for inequality-constrained optimization. Optim. Lett. 3(1): 7-10 (2009) - 2005
- [c2]Olga Brezhneva, Alexey Tret'yakov:
P-Factor-Approach to Degenerate Optimization Problems. System Modelling and Optimization 2005: 83-90 - 2004
- [j3]Ewa Szczepanik, Alexey Tret'yakov:
High-order extremal principles and P-factor penalty function method for solving irregular optimization problems. Ann. UMCS Informatica 2(1): 269-281 (2004) - 2003
- [j2]Olga Brezhneva, Alexey Tret'yakov:
Optimality Conditions for Degenerate Extremum Problems with Equality Constraints. SIAM J. Control. Optim. 42(2): 729-745 (2003) - [c1]Olga Brezhneva, Alexey Tret'yakov:
The p-th Order Necessary Optimality Conditions for Inequality-Constrained Optimization Problems. ICCSA (1) 2003: 903-911 - 2001
- [j1]Alexey F. Izmailov, Vladimir G. Karmanov, Alexey Tret'yakov:
Regularization of Linear Approximate Schemes by the Gradient Descent. SIAM J. Numer. Anal. 39(1): 250-263 (2001)
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-03-10 21:48 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:
