Augmented Lagrangian Method for Mathematical Programs with Second-Order Cone Complementarity Constraints
Abstract
This paper investigates mathematical programs with second-order cone complementarity constraints (SOCMPCCs), which extend classical mathematical programs with complementarity constraints (MPCCs) by incorporating second-order cone structures. SOCMPCCs present significant theoretical and computational challenges, primarily due to the failure of standard constraint qualifications (such as Robinson's constraint qualification) at all feasible points. This difficulty hinders the direct application of classical nonlinear programming theories and algorithms. Motivated by the success of the augmented Lagrangian method (ALM) in solving MPCCs, we explore its extension to SOCMPCCs. The ALM, known for its matrix-free implementation and strong local convergence properties, is well suited for handling the intricate interplay between complementarity and second-order cone constraints. In this paper, we propose a tailored ALM algorithm framework for SOCMPCCs and establish its feasibility and convergence properties. We show that, under bounded ALM penalty parameters or bounded augmented Lagrangian functions, the generated sequence converges to feasible points of the SOCMPCC. Moreover, under the feasibility and an additional SOCMPCC-weak-Robinson's constraint qualification, we prove convergence to K-stationary points, which constitute a fundamental optimality condition for SOCMPCCs. Numerical experiments, including both illustrative examples and high-dimensional problems, are conducted to demonstrate the effectiveness and practical applicability of the proposed algorithm in addressing the challenges inherent in SOCMPCCs.
Related
- A Smoothed Augmented Lagrangian Method for Mathematical Programs with Vertical Complementarity Constraints
- Randomized Branch Methods with Inexact Subproblems for Bouligand Stationarity in Linear and Quadratic Programs with Complementarity Constraints
- Nonconvex Composite Functional Constraints via First-Order Augmented Lagrangian Methods under Local Regularity
- ALDER: A Single-Loop Augmented-Lagrangian Damped Extragradient Method for Nonconvex--Concave Minimax Problems with Nonlinear Coupled Constraints
- Augmented Lagrangian methods with telescopic subproblems for MPCCs and cardinality constraints with general constraints: constraint-preserving swaps and B-stationarity
BibTeX
@misc{liang2026augmented,
title = {{Augmented Lagrangian Method for Mathematical Programs with Second-Order Cone Complementarity Constraints}},
author = {Yan-Chao Liang and Chen-Yuan Zhu and Sheng-Jie Zhang and Gui-Hua Lin and Xide Zhu},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2606.16820},
eprint = {2606.16820},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2606.16820},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Augmented Lagrangian Method for Mathematical Programs with Second-Order Cone Complementarity Constraints
AU - Yan-Chao Liang
AU - Chen-Yuan Zhu
AU - Sheng-Jie Zhang
AU - Gui-Hua Lin
AU - Xide Zhu
PY - 2026
DA - 2026/10/16
PB - arXiv
DO - 10.48550/arxiv.2606.16820
UR - https://arxiv.org/abs/2606.16820
AB - This paper investigates mathematical programs with second-order cone complementarity constraints (SOCMPCCs), which extend classical mathematical programs with complementarity constraints (MPCCs) by incorporating second-order cone structures. SOCMPCCs present significant theoretical and computational challenges, primarily due to the failure of standard constraint qualifications (such as Robinson's constraint qualification) at all feasible points. This difficulty hinders the direct application of classical nonlinear programming theories and algorithms. Motivated by the success of the augmented Lagrangian method (ALM) in solving MPCCs, we explore its extension to SOCMPCCs. The ALM, known for its matrix-free implementation and strong local convergence properties, is well suited for handling the intricate interplay between complementarity and second-order cone constraints. In this paper, we propose a tailored ALM algorithm framework for SOCMPCCs and establish its feasibility and convergence properties. We show that, under bounded ALM penalty parameters or bounded augmented Lagrangian functions, the generated sequence converges to feasible points of the SOCMPCC. Moreover, under the feasibility and an additional SOCMPCC-weak-Robinson's constraint qualification, we prove convergence to K-stationary points, which constitute a fundamental optimality condition for SOCMPCCs. Numerical experiments, including both illustrative examples and high-dimensional problems, are conducted to demonstrate the effectiveness and practical applicability of the proposed algorithm in addressing the challenges inherent in SOCMPCCs.
ER -