1 citations · 1 across the 7 of their papers we have counts for
7 papers
A Scalable Interior-Point Gauss-Newton Method for PDE-Constrained Optimization with Bound Constraints
Tucker Hartland, Cosmin G. Petra, Noemi Petra +1
We present a scalable approach to solve a class of elliptic partial differential equation (PDE)-constrained optimization problems with bound constraints. This approach utilizes a r…
A line search filter sequential adaptive cubic regularisation algorithm for nonlinearly constrained optimization
Yonggang Pei, Jingyi Wang, Shaofang Song +2
In this paper, a sequential adaptive regularization algorithm using cubics (ARC) is presented to solve nonlinear equality constrained optimization. It is motivated by the idea of h…
Design optimization in unilateral contact using pressure constraints and Bayesian optimization
Jingyi Wang, Jerome Solberg, Mike A. Puso +2
Design optimization problems, e.g., shape optimization, that involve deformable bodies in unilateral contact are challenging as they require robust contact solvers, complex optimiz…
Local convergence of a sequential quadratic programming method for a class of nonsmooth nonconvex objectives
Jingyi Wang, Cosmin G. Petra
A sequential quadratic programming (SQP) algorithm is designed for nonsmooth optimization problems with upper-C^2 objective functions. Upper-C^2 functions are locally equivalent to…
A sequential quadratic programming method for nonsmooth stochastic optimization with upper-C^2 objective
J. Wang, I. Aravena, C. G. Petra
We propose a sequential quadratic programming (SQP) method that can incorporate adaptive sampling for stochastic nonsmooth nonconvex optimization problems with upper-C^2 objectives…
An Optimization algorithm for nonsmooth nonconvex problems with upper-C^2 objective
Jingyi Wang, Cosmin G. Petra
An optimization algorithm for nonsmooth nonconvex constrained optimization problems with upper-C2 objective functions is proposed and analyzed. Upper-C2 is a weakly concave propert…
A simplified nonsmooth nonconvex bundle method with applications to security-constrained ACOPF problems
Jingyi Wang, Cosmin G. Petra
An optimization algorithm for a group of nonsmooth nonconvex problems inspired by two-stage stochastic programming problems is proposed. The main challenges for these problems incl…