Efficient Optimization of Non-Decreasing Constrained Problems Using a Penalty-Based Guardrail Algorithm

A penalty-based guardrail algorithm (PGA) that efficiently solves minimization problems with increasing (possibly) nonlinear and non-convex objective function and non-decreasing (possibly) nonlinear and non-convex inequality constraints.