Penalty Interior-Point Algorithm (PIPA)

• PIPA is a family of algorithms for mathematical programs with equilibrium constraints that integrate penalty merit functions with interior-point regularization to indirectly enforce complementarity.
• It uses an SQP-style model, Newton steps for equilibrium conditions, and a trust-region-like bound to compute search directions while preserving strict positivity and centrality.
• Variants of PIPA extend its penalty-barrier philosophy to smooth, nonsmooth, and derivative-free settings, demonstrating versatility in optimization frameworks, including PDE-constrained problems.

Penalty Interior-Point Algorithm (PIPA) most classically denotes a method for mathematical programs with equilibrium constraints (MPECs) that combines a penalty merit function with interior-point regularization of complementarity variables. In that form, it couples an SQP-style model in the upper-level variables, a Newton step for the equilibrium system, and a primal-dual centering condition, then globalizes the step by line search and penalty updates (Yu, 17 Apr 2026). The cited literature also uses the acronym for several broader penalty-barrier or proximal-regularized schemes in smooth, nonsmooth, derivative-free, black-box, and PDE-constrained optimization. This suggests that PIPA is best understood as a family of closely related algorithmic designs rather than a single universally fixed procedure (Marchi et al., 2024, Marchi, 2022).

1. Classical MPEC formulation

In the workshop notes on MPEC algorithms, the classical PIPA is formulated for the problem

$$\begin{aligned} \min_{x,y,w,z}\quad & f(x,y,w,z) \ \text{s.t.}\quad & x\in X,\ & F(x,y,w,z)=0,\ & y\ge 0,\quad w\ge 0,\quad y^\top w=0, \end{aligned}$$

where $x\in\mathbb{R}^n$, $(y,w)\in\mathbb{R}^m\times\mathbb{R}^m$, $z\in\mathbb{R}^\ell$, $X\subset\mathbb{R}^n$ is closed-convex, often polyhedral, and $$F:\mathbb{R}^n\times\mathbb{R}^m\times\mathbb{R}^m\times\mathbb{R}^\ell\to\mathbb{R}^{m+\ell}$$ is $C^2$ (Yu, 17 Apr 2026). The model is representative of MPEC structure: the feasible set contains a lower-level equilibrium system, often written through complementarity or variational-inequality conditions, and this destroys the smooth manifold or convex structure that standard nonlinear programming methods rely on.

The algorithm uses two scalar diagnostics. The infeasibility measure is

$\phi(x,y,w,z):=\|F(x,y,w,z)\|^2+y^\top w,$

and, for a penalty multiplier $\alpha>0$, the composite merit function is

$$P_\alpha(x,y,w,z):=f(x,y,w,z)+\alpha\,\phi(x,y,w,z).$$

Here $x\in\mathbb{R}^n$0 simultaneously tracks violation of $x\in\mathbb{R}^n$1 and complementarity, while $x\in\mathbb{R}^n$2 combines feasibility restoration with objective decrease. Exact complementarity $x\in\mathbb{R}^n$3 is recovered in the limit $x\in\mathbb{R}^n$4 (Yu, 17 Apr 2026).

A central feature of the classical construction is that complementarity is not enforced directly at each iterate. Instead, PIPA keeps the complementarity variables strictly positive and approaches the complementarity manifold from the interior. This places the method in the hybrid class between penalty methods, SQP, and primal-dual interior-point algorithms.

2. Search direction, centrality, and well-posedness

At every iterate, classical PIPA enforces strict positivity

$x\in\mathbb{R}^n$5

together with a centrality condition. Writing

$x\in\mathbb{R}^n$6

the algorithm requires, for a fixed $x\in\mathbb{R}^n$7,

$x\in\mathbb{R}^n$8

This keeps all pairs $x\in\mathbb{R}^n$9 in a neighborhood of the classical interior-point path and prevents one component from collapsing far faster than the others (Yu, 17 Apr 2026).

The search direction $(y,w)\in\mathbb{R}^m\times\mathbb{R}^m$0 at $(y,w)\in\mathbb{R}^m\times\mathbb{R}^m$1 is obtained from a quadratic program. With

$(y,w)\in\mathbb{R}^m\times\mathbb{R}^m$2

the subproblem is

$(y,w)\in\mathbb{R}^m\times\mathbb{R}^m$3

The objective is an SQP model on $(y,w)\in\mathbb{R}^m\times\mathbb{R}^m$4; the linear equation for $(y,w)\in\mathbb{R}^m\times\mathbb{R}^m$5 is the Newton step for $(y,w)\in\mathbb{R}^m\times\mathbb{R}^m$6; the final linear system is the perturbed complementarity step with centering parameter $(y,w)\in\mathbb{R}^m\times\mathbb{R}^m$7; and the bound on $(y,w)\in\mathbb{R}^m\times\mathbb{R}^m$8 is a trust-region-like coupling between the upper-level step and current infeasibility (Yu, 17 Apr 2026).

Well-posedness hinges on a nonsingularity assumption. For all $(y,w)\in\mathbb{R}^m\times\mathbb{R}^m$9, the block matrix

$z\in\mathbb{R}^\ell$0

is assumed nonsingular. In the notes this is tied to a mixed $z\in\mathbb{R}^\ell$1-type assumption on the Jacobian of the lower-level system. Under this condition, once $z\in\mathbb{R}^\ell$2 is chosen by the QP, the variables $z\in\mathbb{R}^\ell$3 are uniquely determined (Yu, 17 Apr 2026).

3. Globalization, convergence claims, and the Leyffer caveat

After computing a direction, classical PIPA defines the trial path

$z\in\mathbb{R}^\ell$4

A backtracking line search selects the largest $z\in\mathbb{R}^\ell$5 such that four conditions hold simultaneously: positivity of $z\in\mathbb{R}^\ell$6 and $z\in\mathbb{R}^\ell$7; preservation of centrality $z\in\mathbb{R}^\ell$8; sufficient decrease in infeasibility,

$z\in\mathbb{R}^\ell$9

and sufficient decrease in merit,

$X\subset\mathbb{R}^n$0

for fixed $X\subset\mathbb{R}^n$1. If no positive step satisfies these conditions, the penalty parameter is increased, for example by $X\subset\mathbb{R}^n$2 with $X\subset\mathbb{R}^n$3, and the search is repeated (Yu, 17 Apr 2026).

The classical convergence statement is conditional. Under the standing assumptions that $X\subset\mathbb{R}^n$4 is convex and closed, the level set of $X\subset\mathbb{R}^n$5 is bounded, the mixed-$X\subset\mathbb{R}^n$6 block is nonsingular, and the iterate sequence is bounded, the notes state that all iterates remain in the strictly interior region, centrality is preserved, and the sequence admits accumulation points. Moreover, if at a cluster point $X\subset\mathbb{R}^n$7 strict complementarity holds componentwise, $X\subset\mathbb{R}^n$8, and the Jacobian block $X\subset\mathbb{R}^n$9 is nonsingular, then $$F:\mathbb{R}^n\times\mathbb{R}^m\times\mathbb{R}^m\times\mathbb{R}^\ell\to\mathbb{R}^{m+\ell}$$0 satisfies the MPEC-KKT conditions (Yu, 17 Apr 2026).

The major controversy is the validity of the strongest global convergence claim. The notes emphasize a caveat due to Leyffer: because of the shrinking trust-region-type constraint

$$F:\mathbb{R}^n\times\mathbb{R}^m\times\mathbb{R}^m\times\mathbb{R}^\ell\to\mathbb{R}^{m+\ell}$$1

the upper-level step can stall prematurely, and PIPA can converge to a nonstationary point. Accordingly, the strongest theorem as originally stated does not hold without further modification, such as weakening the trust-region coupling. The same source also states that no explicit worst-case complexity bound is given; locally, the method inherits the general superlinear behavior of interior-point/SQP hybrids under standard second-order assumptions, whereas globally only the usual penalty-method sublinear guarantees, notably monotonic decrease of $$F:\mathbb{R}^n\times\mathbb{R}^m\times\mathbb{R}^m\times\mathbb{R}^\ell\to\mathbb{R}^{m+\ell}$$2, are available (Yu, 17 Apr 2026).

4. Broader uses of the acronym in smooth constrained optimization

The acronym has been adopted in several later frameworks that retain the penalty-plus-barrier philosophy while changing the mathematical model, the subproblem structure, or both.

Setting	Defining construction	Source
MPEC	Merit $$F:\mathbb{R}^n\times\mathbb{R}^m\times\mathbb{R}^m\times\mathbb{R}^\ell\to\mathbb{R}^{m+\ell}$$3, interior complementarity, QP direction, line search	(Yu, 17 Apr 2026)
Smooth nonconvex constraints	Marginalized penalty-barrier functional $$F:\mathbb{R}^n\times\mathbb{R}^m\times\mathbb{R}^m\times\mathbb{R}^\ell\to\mathbb{R}^{m+\ell}$$4	(Marchi et al., 2024)
Optimization and control	Barrier-prox subproblem with dual proximal term	(Marchi, 2022)
Penalty-barrier NLP	Three-level scheme with MALM and path-following Newton	(Neuenhofen, 2018)

In the nonconvex constrained-optimization framework of "A penalty barrier framework for nonconvex constrained optimization" (Marchi et al., 2024), PIPA starts from

$$F:\mathbb{R}^n\times\mathbb{R}^m\times\mathbb{R}^m\times\mathbb{R}^\ell\to\mathbb{R}^{m+\ell}$$5

and combines an exact $$F:\mathbb{R}^n\times\mathbb{R}^m\times\mathbb{R}^m\times\mathbb{R}^\ell\to\mathbb{R}^{m+\ell}$$6-penalty with an interior-point barrier. After introducing slacks and then minimizing them out in closed form, the method obtains the smooth unconstrained subproblem

$$F:\mathbb{R}^n\times\mathbb{R}^m\times\mathbb{R}^m\times\mathbb{R}^\ell\to\mathbb{R}^{m+\ell}$$7

This marginalization step is described as closely related to a conjugacy operation and produces a full-domain functional that is $$F:\mathbb{R}^n\times\mathbb{R}^m\times\mathbb{R}^m\times\mathbb{R}^\ell\to\mathbb{R}^{m+\ell}$$8 apart from $$F:\mathbb{R}^n\times\mathbb{R}^m\times\mathbb{R}^m\times\mathbb{R}^\ell\to\mathbb{R}^{m+\ell}$$9. The algorithm solves a sequence of such subproblems with decreasing $C^2$0 and increasing $C^2$1, and it can use generic inner solvers such as prox-gradient, quasi-Newton, or accelerated methods. In the fully nonconvex setting, it either terminates at an $C^2$2-KKT point or runs forever with $C^2$3, $C^2$4, in which case every feasible accumulation point is asymptotically KKT optimal. In the convex setting, stronger statements are available: every accumulation point is a global solution, $C^2$5 eventually stabilizes when $C^2$6 is bounded, and under a well-behaved barrier the infeasibility $C^2$7 decays $C^2$8-linearly as $C^2$9 (Marchi et al., 2024).

A different reinterpretation appears in the proximal-regularized interior-point method for constrained optimization and control (Marchi, 2022). There, PIPA addresses

$\phi(x,y,w,z):=\|F(x,y,w,z)\|^2+y^\top w,$0

through one barrier-prox subproblem per outer iteration: $\phi(x,y,w,z):=\|F(x,y,w,z)\|^2+y^\top w,$1 The parameters $\phi(x,y,w,z):=\|F(x,y,w,z)\|^2+y^\top w,$2 and $\phi(x,y,w,z):=\|F(x,y,w,z)\|^2+y^\top w,$3 are reduced only when progress in primal infeasibility or complementarity stalls, and the method terminates on a relaxed KKT test. The convergence analysis states that any feasible limit point is AKKT, and if the multiplier sequences remain bounded then it is a true KKT point; otherwise a limit point is a KKT point of the least-squares feasibility problem $\phi(x,y,w,z):=\|F(x,y,w,z)\|^2+y^\top w,$4. On 609 CUTEst problems with up to 1000 variables and constraints, PIPA solved strictly more problems than both a standard interior-point implementation and an augmented-Lagrangian solver at $\phi(x,y,w,z):=\|F(x,y,w,z)\|^2+y^\top w,$5 and $\phi(x,y,w,z):=\|F(x,y,w,z)\|^2+y^\top w,$6 (Marchi, 2022).

Martin Neuenhofen’s penalty-barrier nonlinear-programming method (Neuenhofen, 2018) uses the same acronym for a three-level nested scheme. It directly minimizes a merit function that combines quadratic penalties, logarithmic barriers, and a regularization term: $\phi(x,y,w,z):=\|F(x,y,w,z)\|^2+y^\top w,$7 The outermost loop reduces the barrier parameter, the outer loop performs a modified augmented-Lagrangian update, and the inner loop applies a globalized quasi-Newton path-following step to a primal-dual root system $\phi(x,y,w,z):=\|F(x,y,w,z)\|^2+y^\top w,$8. The paper proves global convergence to stationary points of $\phi(x,y,w,z):=\|F(x,y,w,z)\|^2+y^\top w,$9, local quadratic convergence of the inner iteration, and a weakly-polynomial complexity result for linear programming with $\alpha>0$0. It also uses a trust-funnel to avoid convergence to stationary points that are infeasible to the constraints (Neuenhofen, 2018).

5. Derivative-free and black-box variants

In derivative-free constrained optimization, PIPA has been incorporated into direct-search frameworks by splitting the inequality set into a barrier-treated subset and a penalty-treated subset. In "Nonlinear Derivative-free Constrained Optimization with a Penalty-Interior Point Method and Direct Search" (Brilli et al., 24 Apr 2025), the merit function is

$\alpha>0$1

The partition is initialized from the starting point: $\alpha>0$2 The algorithm, also denoted LOG-DS, alternates an optional search step, a poll step over directions generating the local tangent cone, and a barrier/penalty update triggered by the step size $\alpha>0$3. Under continuous differentiability, compactness of the relevant feasible set, tangent-cone generation by the poll directions, and MFCQ at limit points, every accumulation point of the path-following subsequence where $\alpha>0$4 is a KKT-stationary point of the original problem. On over 100 CUTEst problems, the paper reports that LOG-DS achieves the highest efficiency and robustness at all three accuracy levels $\alpha>0$5, and typically solves 80–90% of the suite within 2 000 evaluations, compared with 60–75% for the competitors (Brilli et al., 24 Apr 2025).

Audet et al. use the related name MADS-PIP for nonsmooth blackbox optimization with equality and inequality constraints (Audet et al., 28 Jan 2026). Inequalities are partitioned into $\alpha>0$6 and $\alpha>0$7, and the merit function is built from an aggregated interior violation

$\alpha>0$8

and an exterior-violation measure

$\alpha>0$9

For a penalty-barrier parameter $$P_\alpha(x,y,w,z):=f(x,y,w,z)+\alpha\,\phi(x,y,w,z).$$0,

$$P_\alpha(x,y,w,z):=f(x,y,w,z)+\alpha\,\phi(x,y,w,z).$$1

Each outer iteration approximately solves the unconstrained subproblem by MADS, then updates $$P_\alpha(x,y,w,z):=f(x,y,w,z)+\alpha\,\phi(x,y,w,z).$$2 when the mesh size satisfies $$P_\alpha(x,y,w,z):=f(x,y,w,z)+\alpha\,\phi(x,y,w,z).$$3. The convergence theory proves that the set of path-following indices is infinite, $$P_\alpha(x,y,w,z):=f(x,y,w,z)+\alpha\,\phi(x,y,w,z).$$4, and $$P_\alpha(x,y,w,z):=f(x,y,w,z)+\alpha\,\phi(x,y,w,z).$$5 along that subsequence. Under FCQ, end-path points are feasible; under SCQ and in the inequality-only case, feasible end-path points are Clarke-stationary. In equality-plus-inequality tests, including 25 CUTEst problems and an aircraft-range MDO black-box, MADS-PIP found feasible solutions in approximately 95% of runs and substantially outperformed the progressive-barrier variant when equalities were present (Audet et al., 28 Jan 2026).

6. Specialized applications, related lineages, and recurring themes

Specialized versions of PIPA appear in mixed-integer PDE-constrained optimization and in infeasible-start convex quadratic programming. Garmatter, Porcelli, Rinaldi, and Stoll develop an improved penalty interior-point algorithm for the finite-dimensional problem obtained from PDE control with binary controls and a knapsack constraint (Garmatter et al., 2019). The method combines an exact concave quadratic penalty

$$P_\alpha(x,y,w,z):=f(x,y,w,z)+\alpha\,\phi(x,y,w,z).$$6

with an interior-point treatment of the continuous relaxation and a basin-hopping perturbation strategy. Proposition 3.4 states that for sufficiently small $$P_\alpha(x,y,w,z):=f(x,y,w,z)+\alpha\,\phi(x,y,w,z).$$7, the penalized formulation is exact. The practical PIPA, however, drops the requirement of globally solving each penalized subproblem and therefore loses the rigorous global-convergence proof available for the underlying exact-penalty scheme. Numerically, on 20 random instances per $$P_\alpha(x,y,w,z):=f(x,y,w,z)+\alpha\,\phi(x,y,w,z).$$8, PIPA found the best objective in 100% of $$P_\alpha(x,y,w,z):=f(x,y,w,z)+\alpha\,\phi(x,y,w,z).$$9 runs and approximately 65–75% for $x\in\mathbb{R}^n$00, with CPU times 900–1400 s, while CPLEX timed out for $x\in\mathbb{R}^n$01 and the simpler penalty method was faster but much less reliable (Garmatter et al., 2019).

The infeasible-start framework for convex quadratic optimization uses an exact $x\in\mathbb{R}^n$02-penalty outer loop wrapped around an existing feasible-start interior-point method (Laiu et al., 2019). Equalities are handled by paired inequalities with nonnegative relaxation variables, and the penalty parameter $x\in\mathbb{R}^n$03 is updated so as to cross the exactness threshold determined by current dual surrogates. Under strict feasibility and rank assumptions, the method eventually stabilizes $x\in\mathbb{R}^n$04, converges to a solution of the original problem, or produces a Farkas infeasibility certificate together with an $x\in\mathbb{R}^n$05-least relaxation. On random imbalanced CQPs with equalities, the reported implementation ran 3–9× faster than MOSEK; on SVM data sets it was 1.2–4.1× faster, and infeasibility certificates for non-separable instances appeared within approximately 10 outer iterations (Laiu et al., 2019).

A related but distinct line-search primal-dual penalty interior-point relaxation method is given by Liu and Dai (Liu et al., 2018). Their algorithm uses a logarithmic-barrier penalty function depending on both primal and dual variables, does not require any primal or dual iterates to be interior-points, and adaptively updates a penalty parameter. The convergence theory states that if the barrier parameter tends to zero, the method terminates at an approximate KKT point; otherwise it finds either an approximate infeasible stationary point or an approximate singular stationary point. This line of work is not the classical MPEC PIPA, but it illustrates the same design pattern of coupling a penalty term, a barrier term, and globalization by line search (Liu et al., 2018).

Taken together, these developments indicate three recurrent structural motifs. First, PIPA methods use a penalty mechanism to drive feasibility, exactness, or relaxation control. Second, they use an interior or barrier mechanism to preserve strict positivity or strict interiority for selected variables or constraints. Third, they rely on an outer globalization device—line search, parameter updates, proximal regularization, mesh refinement, or perturbation—to balance progress in optimality and feasibility. The main cautionary lesson remains the one already visible in the classical MPEC setting: an elegant hybrid structure does not by itself guarantee a correct global stationarity theorem, and the validity of the globalization mechanism is often the decisive technical issue (Yu, 17 Apr 2026).