Cover Image

A Lasry-Lions envelope approach for mathematical programs with complementarity constraints

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Wang, Jia, Themelis, Andreas, Markovsky, Ivan, Patrinos, Panagiotis
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control 65K05, 90C06, 90C30, 90C33
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the convergence of proximal gradient methods for convex simple bilevel optimization
by: Latafat, Puya, et al.
Published: (2023)

On the convergence of adaptive first order methods: proximal gradient and alternating minimization algorithms
by: Latafat, Puya, et al.
Published: (2023)

Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient
by: Latafat, Puya, et al.
Published: (2023)

Adaptive proximal gradient methods are universal without approximation
by: Oikonomidis, Konstantinos A., et al.
Published: (2024)

Safeguarding adaptive methods: global convergence of Barzilai-Borwein and other stepsize choices
by: Ou, Hongjia, et al.
Published: (2024)

Linesearch-free adaptive Bregman proximal gradient for convex minimization without relative smoothness
by: Ou, Hongjia, et al.
Published: (2025)

Mathematical programs with complementarity constraints and application to hyperparameter tuning for nonlinear support vector machines
by: Ward, Samuel, et al.
Published: (2025)

A new envelope function for nonsmooth DC optimization
by: Themelis, Andreas, et al.
Published: (2020)

Mixed-integer linearity in nonlinear optimization: a trust region approach
by: De Marchi, Alberto
Published: (2023)

A non-monotone trust-region method with noisy oracles and additional sampling
by: Krejic, Natasa, et al.
Published: (2023)

A MINRES-based Linesearch Algorithm for Nonconvex Optimization with Non-positive Curvature Detection
by: Zeng, Hanfeng, et al.
Published: (2026)

A linesearch-type normal map-based semismooth Newton method for nonsmooth nonconvex composite optimization
by: Zeng, Hanfeng, et al.
Published: (2026)

Variational Properties of Decomposable Functions. Part I: Strict Epi-Calculus and Applications
by: Ouyang, Wenqing, et al.
Published: (2023)

Randomized block proximal method with locally Lipschitz continuous gradient
by: Pérez-Aros, Pedro, et al.
Published: (2025)

Variational Properties of Decomposable Functions. Part II: Strong Second-Order Theory
by: Ouyang, Wenqing, et al.
Published: (2023)

Hybrid optimal control with mixed-integer Lagrangian methods
by: Nikitina, Viktoriya, et al.
Published: (2024)

Affordable mixed-integer Lagrangian methods: optimality conditions and convergence analysis
by: De Marchi, Alberto
Published: (2024)

PANOC-lite: A simpler and more efficient algorithm for composite minimization
by: Bodard, Alexander, et al.
Published: (2026)

Oracle complexities of augmented Lagrangian methods for nonsmooth manifold optimization
by: Deng, Kangkang, et al.
Published: (2024)

Fast Frank--Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions
by: Takahashi, Shota, et al.
Published: (2025)

Anderson Accelerated Primal-Dual Hybrid Gradient for solving LP
by: Zhou, Yingxin, et al.
Published: (2025)

A penalty barrier framework for nonconvex constrained optimization
by: De Marchi, Alberto, et al.
Published: (2024)

A globalization of L-BFGS and the Barzilai-Borwein method for nonconvex unconstrained optimization
by: Mannel, Florian
Published: (2024)

Gauss-Newton meets PANOC: A fast and globally convergent algorithm for nonlinear optimal control
by: Pas, Pieter, et al.
Published: (2022)

A structured L-BFGS method and its application to inverse problems
by: Mannel, Florian, et al.
Published: (2023)

A structured L-BFGS method with diagonal scaling and its application to image registration
by: Mannel, Florian, et al.
Published: (2024)

Heavy-ball Differential Equation Achieves $O(\varepsilon^{-7/4})$ Convergence for Nonconvex Functions
by: Okamura, Kaito, et al.
Published: (2024)

Stability and convergence analysis of AdaGrad for non-convex optimization via novel stopping time-based techniques
by: Jin, Ruinan, et al.
Published: (2024)

Second-order Information Promotes Mini-Batch Robustness in Variance-Reduced Gradients
by: Garg, Sachin, et al.
Published: (2024)

Accelerated Gradient Methods with Gradient Restart: Global Linear Convergence
by: Bao, Chenglong, et al.
Published: (2024)

The Global R-linear Convergence of Nesterov's Accelerated Gradient Method with Unknown Strongly Convex Parameter
by: Bao, Chenglong, et al.
Published: (2023)

Steering exact penalty DCA for nonsmooth DC optimization problems with equality and inequality constraints
by: Dolgopolik, M. V.
Published: (2021)

On stability of the Scholtes regularization for mathematical programs with complementarity constraints
by: Shikhman, Vladimir, et al.
Published: (2025)

A New Two-dimensional Model-based Subspace Method for Large-scale Unconstrained Derivative-free Optimization: 2D-MoSub
by: Xie, Pengcheng, et al.
Published: (2023)

On the asymptotic behavior of a higher-order extrapolation primal-dual interior-point method for nonlinear programming
by: Heeman, Pim, et al.
Published: (2025)

Gradient descent with adaptive stepsize converges (nearly) linearly under fourth-order growth
by: Davis, Damek, et al.
Published: (2024)

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
by: Zhou, Juan, et al.
Published: (2024)

A modified exact penalty approach for general constrained $\ell_0$-sparse optimization problems
by: Kanzow, Christian, et al.
Published: (2025)

Asymptotic Convergence and Stability of Adaptive Gradient Methods in Smooth Non-convex Optimization
by: Jin, Ruinan, et al.
Published: (2026)

Bregman Stochastic Proximal Point Algorithm with Variance Reduction
by: Traoré, Cheik, et al.
Published: (2025)