Sparse PCA with Overlapping Supports: NP-Hardness and an FPTAS

In sparse principal component analysis (SPCA) with several components, each must be sparse and all must be pairwise orthogonal. When the supports of the components overlap, these two requirements interact. For a covariance matrix of fixed rank, polynomial-time algorithms with optimality or approximation guarantees are known for one component, and for several components with disjoint … Read more

Multi-split Multiple-sets Implicit Convex Feasibility Seeking As Split Inverse Problems

We introduce a new class of problems, termed multi-split multiple-sets implicit convex feasibility problems (MSMS-ICFPs), define a proximity function for it and analyze its properties under certain assumptions on the involved general point-to-set operators. Additionally, we discuss its properties for a special class of point-to-set operators. For these kinds of point-to-set operators, we deploy a … Read more

A Retrospective-Approximation Interior-Point Method

An algorithm is proposed, analyzed, and tested for solving nonlinearly constrained continuous optimization problem instances wherein the objective function is defined by an expectation over a random variable argument and the constraints include inequalities (and perhaps equalities) involving functions that may be nonconvex. The algorithm combines a retrospective-approximation strategy for handling the objective and an … Read more

Quasinormality in nonlinear second-order cone programming

We introduce quasinormality and pseudonormality for nonlinear second-order cone programming by exploiting the spectral geometry of the Lorentz cone. The proposed quasinormality distinguishes interior and boundary multipliers and, in the latter case, relates constraint violation to the corresponding spectral direction. It recovers classical quasinormality when all cone blocks are one-dimensional and is strictly weaker than … Read more

Normalized-step stochastic SQP methods for nonconvex constrained optimization under heavy-tailed noise

In this paper, we study nonconvex constrained optimization with expectation equality constraints and non-negative bounds under heavy-tailed noise. The objective gradients, constraint values, and constraint Jacobian are accessed through stochastic oracles whose errors have bounded $p$th central moments for some $p\in(1,2)$. These conditions allow infinite-variance errors for the three types of stochastic oracles, rendering traditional … Read more

A Stochastic Proximal-Gradient Method for Regularized Generally Constrained Continuous Optimization

A stochastic proximal-gradient method is proposed and analyzed for solving regularized optimization problems subject to nonlinear equality constraints and nonnegativity bounds. The objective function’s values and gradients are available only through inexact stochastic oracles. The method decomposes each trial step into one component that reduces linearized infeasibility and a second component that seeks optimality while … Read more

Risk-Constrained MPPI Tuning with Update-Aware MA-ES Racing

We formulate offline tuning of Model Predictive Path Integral (MPPI) controllers as a chance-constrained black-box optimization problem and develop an update-aware framework based on Matrix Adaptation Evolution Strategy (MA-ES). We use statistical information from noisy controller evaluations to determine when the evolutionary update is sufficiently reliable. When the recombination direction is certified, a derivative-free nonmonotone … Read more

Stochastic Augmented Lagrangian Framework with Second-Order Convergence Guarantees for Nonconvex Expectation-Constrained Optimization

In this paper, we propose and analyze an augmented Lagrangian framework for solving stochastic nonconvex optimization problems with expectation-based equality constraints over a closed and convex constraint set. The framework generates a sequence of nonconvex primal subproblems, which are solved inexactly using stochastic second-order methods. We establish iteration complexity results for obtaining approximate second-order stationary … Read more

A branch-and-bound algorithm for the computation of optimal point mappings of parametric optimization problems

We propose a novel branch‑and‑bound algorithm that constructs rigorous outer approximations of the optimal point mapping for parametric optimization problems with guaranteed feasibility and optimality tolerances. The method uses the improvement‑function reformulation to define discarding and inclusion tests on sub-boxes, constructing a rigorous outer approximation. Under the same regularity conditions that ensure exactness of this … Read more

A Computational Toolbox for Linear Optimization with Joint Affine Chance Constraints

We present a Julia computational toolbox for linear optimization problems with joint affine chance constraints under elliptically symmetric uncertainty. The toolbox combines a spherical–radial oracle for estimating the joint probability and its gradient with three structured optimization methods: Proximal, Feasible, and Penalty. The oracle supports several elliptically symmetric distributions and is integrated with these methods … Read more