default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRegina Sandra Burachik
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j37]Regina Sandra Burachik
, Bethany I. Caldwell, C. Yalçin Kaya, Walaa M. Moursi:
Optimal Control Duality and the Douglas-Rachford Algorithm. SIAM J. Control. Optim. 62(1): 680-698 (2024)- [j36]Hoa T. Bui, Regina Sandra Burachik, Evgeni A. Nurminski, Matthew K. Tam:
Single-Projection Procedure for Infinite Dimensional Convex Optimization Problems. SIAM J. Optim. 34(2): 1646-1678 (2024) - 2023
- [j35]Regina Sandra Burachik, Mahmoud Efatmaneshnik, Alexander C. Kalloniatis, C. Yalçin Kaya:
Optimal Organizations Across Many Faces of Complexity: Synchronized Networks With Load-Balance and Minimum Complexity. IEEE Syst. J. 17(4): 5393-5404 (2023) - 2022
- [j34]Regina Sandra Burachik, Yaohua Hu, Xiaoqi Yang:
Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in hilbert spaces. J. Glob. Optim. 83(2): 249-271 (2022) - 2021
- [j33]Regina Sandra Burachik, Minh N. Dao, Scott B. Lindstrom:
Generalized Bregman Envelopes and Proximity Operators. J. Optim. Theory Appl. 190(3): 744-778 (2021) - [j32]Regina Sandra Burachik, Alexander C. Kalloniatis, C. Yalçin Kaya:
Sparse Network Optimization for Synchronization. J. Optim. Theory Appl. 191(1): 229-251 (2021) - [j31]Regina Sandra Burachik, C. Yalçin Kaya:
Steklov convexification and a trajectory method for global optimization of multivariate quartic polynomials. Math. Program. 189(1): 187-216 (2021) - [j30]Regina Sandra Burachik, Minh N. Dao, Scott B. Lindstrom:
The Generalized Bregman Distance. SIAM J. Optim. 31(1): 404-424 (2021) - [i2]Regina Sandra Burachik, Bethany I. Caldwell, C. Yalçin Kaya:
A Generalized Multivariable Newton Method. CoRR abs/2103.14774 (2021) - 2020
- [j29]Orhan Arikan, Regina Sandra Burachik, C. Yalçin Kaya:
Steklov regularization and trajectory methods for univariate global optimization. J. Glob. Optim. 76(1): 91-120 (2020) - [j28]Heinz H. Bauschke, Regina Sandra Burachik, Daniel B. Herman, C. Yalçin Kaya:
On Dykstra's algorithm: finite convergence, stalling, and the method of alternating projections. Optim. Lett. 14(8): 1975-1987 (2020) - [i1]Heinz H. Bauschke, Regina Sandra Burachik, Daniel B. Herman, C. Yalçin Kaya:
On Dykstra's algorithm: finite convergence, stalling, and the method of alternating projections. CoRR abs/2001.06747 (2020)
2010 – 2019
- 2017
- [j27]Regina Sandra Burachik, Xiaoqi Yang, Yu Ying Zhou:
Existence of Augmented Lagrange Multipliers for Semi-infinite Programming Problems. J. Optim. Theory Appl. 173(2): 471-503 (2017) - [j26]Regina Sandra Burachik, C. Yalçin Kaya, M. M. Rizvi:
A New Scalarization Technique and New Algorithms to Generate Pareto Fronts. SIAM J. Optim. 27(2): 1010-1034 (2017) - 2016
- [j25]Regina Sandra Burachik, C. Yalçin Kaya, Mustafa Ç. Pinar:
Special issue on "Non-linear continuous optimization". EURO J. Comput. Optim. 4(1): 1-2 (2016) - 2015
- [j24]Orhan Arikan, Regina Sandra Burachik, C. Yalçin Kaya:
"Backward Differential Flow" May Not Converge to a Global Minimizer of Polynomials. J. Optim. Theory Appl. 167(1): 401-408 (2015) - 2014
- [j23]Regina Sandra Burachik, Wilhelm Passarella Freire, C. Yalçin Kaya:
Interior Epigraph Directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality. J. Glob. Optim. 60(3): 501-529 (2014) - [j22]Regina Sandra Burachik, C. Yalçin Kaya, M. M. Rizvi:
A New Scalarization Technique to Approximate Pareto Fronts of Problems with Disconnected Feasible Sets. J. Optim. Theory Appl. 162(2): 428-446 (2014) - [j21]Regina Sandra Burachik, C. Yalçin Kaya, S. N. Majeed:
A Duality Approach for Solving Control-Constrained Linear-Quadratic Optimal Control Problems. SIAM J. Control. Optim. 52(3): 1423-1456 (2014) - 2013
- [j20]Regina Sandra Burachik, Alfredo N. Iusem, Jefferson G. Melo:
An Inexact Modified Subgradient Algorithm for Primal-Dual Problems via Augmented Lagrangians. J. Optim. Theory Appl. 157(1): 108-131 (2013) - 2012
- [j19]Regina Sandra Burachik, M. M. Rizvi:
On Weak and Strong Kuhn-Tucker Conditions for Smooth Multiobjective Optimization. J. Optim. Theory Appl. 155(2): 477-491 (2012) - [j18]Regina Sandra Burachik, C. Yalçin Kaya, Shoham Sabach:
A Generalized Univariate Newton Method Motivated by Proximal Regularization. J. Optim. Theory Appl. 155(3): 923-940 (2012) - [j17]Konstantin Avrachenkov, Regina Sandra Burachik, Jerzy A. Filar, Vladimir Gaitsgory:
Constraint augmentation in pseudo-singularly perturbed linear programs. Math. Program. 132(1-2): 179-208 (2012) - 2011
- [e1]Heinz H. Bauschke, Regina Sandra Burachik, Patrick L. Combettes, Veit Elser, D. Russell Luke, Henry Wolkowicz:
Fixed-Point Algorithms for Inverse Problems in Science and Engineering. Springer Optimization and Its Applications 49, Springer 2011, ISBN 978-1-4419-9568-1 [contents] - 2010
- [j16]Regina Sandra Burachik, C. Yalçin Kaya, Musa Mammadov:
An inexact modified subgradient algorithm for nonconvex optimization. Comput. Optim. Appl. 45(1): 1-24 (2010) - [j15]Regina Sandra Burachik, Alfredo N. Iusem, Jefferson G. Melo:
A primal dual modified subgradient algorithm with sharp Lagrangian. J. Glob. Optim. 46(3): 347-361 (2010) - [j14]Regina Sandra Burachik, Alfredo N. Iusem, Jefferson G. Melo:
Duality and Exact Penalization for General Augmented Lagrangians. J. Optim. Theory Appl. 147(1): 125-140 (2010) - [j13]Regina Sandra Burachik, Joydeep Dutta:
Inexact Proximal Point Methods for Variational Inequality Problems. SIAM J. Optim. 20(5): 2653-2678 (2010)
2000 – 2009
- 2008
- [j12]Regina Sandra Burachik, L. Mauricio Graña Drummond, Susana Scheimberg:
On some properties and an application of the logarithmic barrier method. Math. Program. 111(1-2): 95-112 (2008) - [j11]Regina Sandra Burachik, Jörg Fliege, Michal Kocvara:
Preface. Optim. Methods Softw. 23(5): 649-650 (2008) - 2007
- [j10]Regina Sandra Burachik, Alexander M. Rubinov:
Abstract Convexity and Augmented Lagrangians. SIAM J. Optim. 18(2): 413-436 (2007) - 2006
- [j9]Regina Sandra Burachik, Rafail N. Gasimov, Nergiz A. Ismayilova, C. Yalçin Kaya:
On a Modified Subgradient Algorithm for Dual Problems via Sharp Augmented Lagrangian. J. Glob. Optim. 34(1): 55-78 (2006) - [j8]Regina Sandra Burachik, Claudia A. Sagastizábal, Susana Scheimberg:
An inexact method of partial inverses and a parallel bundle method. Optim. Methods Softw. 21(3): 385-400 (2006) - 2005
- [j7]Regina Sandra Burachik, Vaithilingam Jeyakumar:
A new geometric condition for Fenchel's duality in infinite dimensional spaces. Math. Program. 104(2-3): 229-233 (2005) - [j6]Regina Sandra Burachik, J. O. Lopes, Benar Fux Svaiter:
An Outer Approximation Method for the Variational Inequality Problem. SIAM J. Control. Optim. 43(6): 2071-2088 (2005) - 2001
- [j5]Regina Sandra Burachik, Benar Fux Svaiter:
A Relative Error Tolerance for a Family of Generalized Proximal Point Methods. Math. Oper. Res. 26(4): 816-831 (2001) - 2000
- [j4]Dan Butnariu, Alfredo N. Iusem, Regina Sandra Burachik:
Iterative Methods of Solving Stochastic Convex Feasibility Problems and Applications. Comput. Optim. Appl. 15(3): 269-307 (2000) - [j3]Regina Sandra Burachik, Susana Scheimberg:
A Proximal Point Method for the Variational Inequality Problem in Banach Spaces. SIAM J. Control. Optim. 39(5): 1633-1649 (2000)
1990 – 1999
- 1999
- [j2]Regina Sandra Burachik, Alfredo N. Iusem:
A generalized proximal point algorithm for the nonlinear complementarity problem. RAIRO Oper. Res. 33(4): 447-479 (1999) - 1998
- [j1]Regina Sandra Burachik, Alfredo N. Iusem:
A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space. SIAM J. Optim. 8(1): 197-216 (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-10-07 22:20 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:
