default search action
Cosmin G. Petra
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j25]Christopher S. Oehmen
, Slaven Peles
Advanced Computing is at the Forefront of a New "Moonshot" Revolutionizing the North American Power Grid. Comput. Sci. Eng. 26(2): 25-32 (2024) - [i7]Jingyi Wang, Jerome Solberg, Mike A. Puso, Eric B. Chin, Cosmin G. Petra:
Design optimization in unilateral contact using pressure constraints and Bayesian optimization. CoRR abs/2405.03081 (2024) - [i6]Tucker Hartland, Cosmin G. Petra, Noemi Petra, Jingyi Wang:
A Scalable Interior-Point Gauss-Newton Method for PDE-Constrained Optimization with Bound Constraints. CoRR abs/2410.14918 (2024) - 2023
- [j24]Ignacio Aravena, Daniel K. Molzahn, Shixuan Zhang
Recent Developments in Security-Constrained AC Optimal Power Flow: Overview of Challenge 1 in the ARPA-E Grid Optimization Competition. Oper. Res. 71(6): 1997-2014 (2023) - [j23]Cosmin G. Petra, Ignacio Aravena:
A Surrogate-Based Asynchronous Decomposition Technique for Realistic Security-Constrained Optimal Power Flow Problems. Oper. Res. 71(6): 2015-2030 (2023) - [j22]Cosmin G. Petra
On the implementation of a quasi-Newton interior-point method for PDE-constrained optimization using finite element discretizations. Optim. Methods Softw. 38(1): 59-90 (2023) - [j21]Shaked Regev
HyKKT: a hybrid direct-iterative method for solving KKT linear systems. Optim. Methods Softw. 38(2): 332-355 (2023) - [j20]Jingyi Wang, Cosmin G. Petra
A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective. SIAM J. Optim. 33(3): 2379-2405 (2023) - 2022
- [j19]Johannes J. Brust
Large-Scale Optimization with Linear Equality Constraints Using Reduced Compact Representation. SIAM J. Sci. Comput. 44(1): 103- (2022) - [i5]Jingyi Wang, Cosmin G. Petra:
A simplified nonsmooth nonconvex bundle method with applications to security-constrained ACOPF problems. CoRR abs/2203.17215 (2022) - [i4]Johannes J. Brust, Zichao Wendy Di, Sven Leyffer, Cosmin G. Petra:
Compact representations of structured BFGS matrices. CoRR abs/2208.00057 (2022) - 2021
- [j18]Johannes J. Brust
Compact representations of structured BFGS matrices. Comput. Optim. Appl. 80(1): 55-88 (2021) - [c4]Jingyi Wang, Naiyuan Chiang, Cosmin G. Petra:
An asynchronous distributed-memory optimization solver for two-stage stochastic programming problems. ISPDC 2021: 33-40 - [i3]Johannes J. Brust, Roummel F. Marcia, Cosmin G. Petra, Michael A. Saunders:
Large-scale Optimization with Linear Equality Constraints using Reduced Compact Representation. CoRR abs/2101.11048 (2021) - [i2]Miguel A. Salazar de Troya, Geoffrey M. Oxberry, Cosmin G. Petra, Daniel A. Tortorelli:
Another source of mesh dependence in topology optimization. CoRR abs/2106.12098 (2021) - [i1]Shaked Regev, Naiyuan Chiang, Eric Darve, Cosmin G. Petra, Michael A. Saunders, Kasia Swirydowicz, Slaven Peles:
A Hybrid Direct-Iterative Method for Solving KKT Linear Systems. CoRR abs/2110.03636 (2021) - 2020
- [j17]Emil M. Constantinescu
Statistical Treatment of Inverse Problems Constrained by Differential Equations-Based Models with Stochastic Terms. SIAM/ASA J. Uncertain. Quantification 8(1): 170-197 (2020) - [j16]Johannes Brust
Computationally Efficient Decompositions of Oblique Projection Matrices. SIAM J. Matrix Anal. Appl. 41(2): 852-870 (2020)
2010 – 2019
- 2019
- [j15]Cosmin G. Petra
A homogeneous model for monotone mixed horizontal linear complementarity problems. Comput. Optim. Appl. 72(1): 241-267 (2019) - [j14]Johannes Brust
Large-scale quasi-Newton trust-region methods with low-dimensional linear equality constraints. Comput. Optim. Appl. 74(3): 669-701 (2019) - [j13]Cosmin G. Petra
A memory-distributed quasi-Newton solver for nonlinear programming problems with a small number of general constraints. J. Parallel Distributed Comput. 133: 337-348 (2019) - [j12]Kibaek Kim
An Asynchronous Bundle-Trust-Region Method for Dual Decomposition of Stochastic Mixed-Integer Programming. SIAM J. Optim. 29(1): 318-342 (2019) - [j11]Cosmin G. Petra
A Structured Quasi-Newton Algorithm for Optimizing with Incomplete Hessian Information. SIAM J. Optim. 29(2): 1048-1075 (2019) - 2018
- [j10]Cosmin G. Petra, Feng Qiang
On efficient Hessian computation using the edge pushing algorithm in Julia. Optim. Methods Softw. 33(4-6): 1010-1029 (2018) - 2014
- [j9]Cosmin G. Petra, Olaf Schenk
Real-Time Stochastic Optimization of Complex Energy Systems on High-Performance Computers. Comput. Sci. Eng. 16(5): 32-42 (2014) - [j8]Cosmin G. Petra, Olaf Schenk
An Augmented Incomplete Factorization Approach for Computing the Schur Complement in Stochastic Optimization. SIAM J. Sci. Comput. 36(2) (2014) - [c3]Naiyuan Chiang, Cosmin G. Petra, Victor M. Zavala:
Structured nonconvex optimization of large-scale energy systems using PIPS-NLP. PSCC 2014: 1-7 - [c2]Joey Huchette
Parallel algebraic modeling for stochastic optimization. HPTCDL@SC 2014: 29-35 - 2013
- [j7]Miles Lubin, J. A. Julian Hall, Cosmin G. Petra, Mihai Anitescu
Parallel distributed-memory simplex for large-scale stochastic LP problems. Comput. Optim. Appl. 55(3): 571-596 (2013) - [j6]Miles Lubin, R. Kipp Martin, Cosmin G. Petra, Burhaneddin Sandikçi
On parallelizing dual decomposition in stochastic integer programming. Oper. Res. Lett. 41(3): 252-258 (2013) - 2012
- [j5]Cosmin G. Petra, Mihai Anitescu
A preconditioning technique for Schur complement systems arising in stochastic optimization. Comput. Optim. Appl. 52(2): 315-344 (2012) - [j4]Miles Lubin, Cosmin G. Petra, Mihai Anitescu
The parallel solution of dense saddle-point linear systems arising in stochastic programming. Optim. Methods Softw. 27(4-5): 845-864 (2012) - [j3]Andrei Draganescu
Multigrid Preconditioning of Linear Systems for Interior Point Methods Applied to a Class of Box-constrained Optimal Control Problems. SIAM J. Numer. Anal. 50(1): 328-353 (2012) - 2011
- [j2]Filiz Gürtuna, Cosmin G. Petra, Florian A. Potra, Olena Shevchenko, Adrian Vancea:
Corrector-predictor methods for sufficient linear complementarity problems. Comput. Optim. Appl. 48(3): 453-485 (2011) - [c1]Miles Lubin, Cosmin G. Petra, Mihai Anitescu
Scalable stochastic optimization of complex energy systems. SC 2011: 64:1-64:64
2000 – 2009
- 2009
- [j1]Cosmin G. Petra, Bogdan I. Gavrea, Mihai Anitescu
A computational study of the use of an optimization-based method for simulating large multibody systems. Optim. Methods Softw. 24(6): 871-894 (2009)
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-12-01 00:08 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: