We present a new solver for non-convex trajectory optimization problems that is specialized
for robotics applications. CALIPSO, or the Conic Augmented Lagrangian Interior-Point …

We analyze sequences generated by interior point methods (IPMs) in convex and
nonconvex settings. We prove that moving the primal feasibility at the same rate as the …

An oil and gas field requires careful operational planning and management via production
optimization for increased recovery and long‐term project profitability. This article addresses …

In this contribution, a small strain single crystal plasticity framework in the context of an
infeasible primal–dual interior point method (IPDIPM) is discussed with a focus on the …

We study infeasible-start, primal–dual interior-point methods for convex optimization
problems given in a typically natural form we denote as domain-driven formulations. Our …

Interior point methods (IPMs) that handle nonconvex constraints such as IPOPT, KNITRO
and LOQO have had enormous practical success. We consider IPMs in the setting where the …

Based on solving an equivalent parametric equality constrained mini-max problem of the
classic logarithmic-barrier subproblem, we present a novel primal-dual interior-point …

We address the problem of minimizing a smooth function $ f^ 0 (x) $ over a compact set $ D
$ defined by smooth functional constraints $ f^ i (x)\leq 0,~ i= 1,\ldots, m $ given noisy value …

We study infeasible-start primal-dual interior-point methods for convex optimization
problems given in a typically natural form we denote as Domain-Driven formulation. Our …

Em um problema de Fluxo de Potência Ótimo (FPO), o objetivo é determinar um ponto de
operação para o sistema elétrico de potência que atenda suas restrições físicas e …