Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2611.09146

Second-order optimality conditions for $C^{1,1}$ sparsity constrained optimization problems via disjunctive programming

Luu Thi Thu Huyen·Liguo Jiao·Nguyen Van Tuyen
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we investigate second-order necessary and sufficient optimality conditions for a class of $C^{1,1}$ sparsity constrained optimization problems via a disjunctive programming approach. More precisely, by utilizing the limiting/Mordukhovich second-order subdifferential of the associated Lagrangian function, we establish new second-order necessary and sufficient optimality conditions for local optimal solutions. These results are derived under mild assumptions and extend several existing results in the literature. In addition, we apply our theoretical developments to sparse multiobjective optimization problems and derive second-order optimality conditions for efficient solutions.

Explore related subjects

math.OC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Luu Thi Thu Huyen, Liguo Jiao, Nguyen Van Tuyen. 2026-11-06. Second-order optimality conditions for $C^{1,1}$ sparsity constrained optimization problems via disjunctive programming. https://arxiv.org/abs/2611.09146

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Decentralized Estimation and Control for Leader-Follower Networked Systems with Asymmetric Information Structure

In this paper, the decentralized estimation and linear quadratic (LQ) control problem for a leader-follower networked system (LFNS) is studied from the perspective of asymmetric information. Specifically, for a leader-follower network, the follower agent will be affected by the leader agent, while the follower agent will not affect the leader agent. Hence, the information sets accessed by the control variables of the leader agent and the follower agent are asymmetric, which will bring essential difficulties in finding the optimal control strategy. To this end, the orthogonal decomposition method is adopted to achieve the main results. The main contributions of this paper can be summarized as follows: Firstly, the optimal iterative estimation is derived using the conditional independence property established in this paper. Secondly, the optimal decentralized control strategy is derived by decoupling the forward-backward stochastic difference equations (FBSDEs), based on the derived optimal iterative estimation. Thirdly, the necessary and sufficient conditions for the feedback stabilization of the LFNS in infinite-horizon are derived. Finally, the proposed theoretical results are applied to solve the decentralized control problem of a leader-follower autonomous underwater vehicle (LF-AUV) system. The optimal control inputs for the AUVs are provided, and simulation results verify the effectiveness of the obtained results.

math.OC↗
arXiv2026

A Measure-Theoretic Formulation of Behavioral Systems

Ensemble control specifies probability laws on admissible trajectories, including their temporal dependence. Starting from an arbitrary closed behavior, we organize its laws into a framework that connects standard probability-measure geometry, occupation-measure control, and data-driven trajectory parametrization. Classical convexity and extreme-point properties describe the feasible laws, while classical Bellman duality governs additive control objectives. On compact state and input spaces, full-path constrained duality for continuous trajectory functions gives primal attainment and zero gap whenever feasible. For controllable linear time-invariant systems, the noise-free Fundamental Lemma yields an equivalent law-level Hankel factorization, with a canonical pseudoinverse lift. The factorization transfers trajectory-law constraints exactly to coefficient space and connects them to covariance control. Explicit noisy-Hankel bounds quantify subspace approximation for second-moment-bounded laws under known rank and Gaussian output measurement noise. Numerical studies include a nonlinear reset problem whose nonadjacent correlation constraint requires temporal memory, covariance-constrained optimization, and noisy-data policy evaluation. Known transition kernels provide a further structural perspective through history-conditional consistency.

math.OC↗
arXiv2026

Optimal Oracle Complexity for Weakly Convex Optimization

We study the oracle complexity of finding $ε$-stationary points of $ρ$-weakly convex and $G$-Lipschitz functions, where stationarity is measured by the gradient of the Moreau envelope. We consider an exact first-order oracle that returns both the function value and the full subdifferential at every query point. In the principal parameter regime, we prove that every first-order algorithm, including randomized algorithms, requires $Ω(\tfrac{ρG^2Δ}{ε^4})$ oracle queries to succeed with any fixed positive probability, where $f(0)-\inf f\leΔ$. This lower bound matches the best known deterministic and stochastic first-order upper bounds, up to universal constants, and establishes the optimal randomized first-order oracle complexity. The result separates smooth nonconvex and weakly convex optimization: the additional $ε^{-2}$ factor is intrinsic to nonsmooth geometry rather than stochastic oracle noise.

math.OC↗