Cosmin G. Petra

Orcid: 0000-0002-1050-3221

According to our database1, Cosmin G. Petra authored at least 29 papers between 2009 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective.
SIAM J. Optim., September, 2023

HyKKT: a hybrid direct-iterative method for solving KKT linear systems.
Optim. Methods Softw., March, 2023

On the implementation of a quasi-Newton interior-point method for PDE-constrained optimization using finite element discretizations.
Optim. Methods Softw., January, 2023

2022
Large-Scale Optimization with Linear Equality Constraints Using Reduced Compact Representation.
SIAM J. Sci. Comput., 2022

A simplified nonsmooth nonconvex bundle method with applications to security-constrained ACOPF problems.
CoRR, 2022

2021
A Hybrid Direct-Iterative Method for Solving KKT Linear Systems.
CoRR, 2021

Another source of mesh dependence in topology optimization.
CoRR, 2021

Compact representations of structured BFGS matrices.
Comput. Optim. Appl., 2021

An asynchronous distributed-memory optimization solver for two-stage stochastic programming problems.
Proceedings of the 20th International Symposium on Parallel and Distributed Computing, 2021

2020
Computationally Efficient Decompositions of Oblique Projection Matrices.
SIAM J. Matrix Anal. Appl., 2020

Statistical Treatment of Inverse Problems Constrained by Differential Equations-Based Models with Stochastic Terms.
SIAM/ASA J. Uncertain. Quantification, 2020

2019
A Structured Quasi-Newton Algorithm for Optimizing with Incomplete Hessian Information.
SIAM J. Optim., 2019

An Asynchronous Bundle-Trust-Region Method for Dual Decomposition of Stochastic Mixed-Integer Programming.
SIAM J. Optim., 2019

A memory-distributed quasi-Newton solver for nonlinear programming problems with a small number of general constraints.
J. Parallel Distributed Comput., 2019

A homogeneous model for monotone mixed horizontal linear complementarity problems.
Comput. Optim. Appl., 2019

Large-scale quasi-Newton trust-region methods with low-dimensional linear equality constraints.
Comput. Optim. Appl., 2019

2018
On efficient Hessian computation using the edge pushing algorithm in Julia.
Optim. Methods Softw., 2018

2014
An Augmented Incomplete Factorization Approach for Computing the Schur Complement in Stochastic Optimization.
SIAM J. Sci. Comput., 2014

Real-Time Stochastic Optimization of Complex Energy Systems on High-Performance Computers.
Comput. Sci. Eng., 2014

Parallel algebraic modeling for stochastic optimization.
Proceedings of the 1st First Workshop for High Performance Technical Computing in Dynamic Languages, 2014

Structured nonconvex optimization of large-scale energy systems using PIPS-NLP.
Proceedings of the 2014 Power Systems Computation Conference, 2014

2013
On parallelizing dual decomposition in stochastic integer programming.
Oper. Res. Lett., 2013

Parallel distributed-memory simplex for large-scale stochastic LP problems.
Comput. Optim. Appl., 2013

2012
Multigrid Preconditioning of Linear Systems for Interior Point Methods Applied to a Class of Box-constrained Optimal Control Problems.
SIAM J. Numer. Anal., 2012

The parallel solution of dense saddle-point linear systems arising in stochastic programming.
Optim. Methods Softw., 2012

A preconditioning technique for Schur complement systems arising in stochastic optimization.
Comput. Optim. Appl., 2012

2011
Corrector-predictor methods for sufficient linear complementarity problems.
Comput. Optim. Appl., 2011

Scalable stochastic optimization of complex energy systems.
Proceedings of the Conference on High Performance Computing Networking, 2011

2009
A computational study of the use of an optimization-based method for simulating large multibody systems.
Optim. Methods Softw., 2009


  Loading...