Cover Image

Moreau Envelope Based Difference-of-weakly-Convex Reformulation and Algorithm for Bilevel Programs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gao, Lucy L., Ye, Jane J., Yin, Haian, Zeng, Shangzhi, Zhang, Jin
Format:	Preprint
Published:	2023
Subjects:	Optimization and Control Machine Learning 90C99
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Alternating Gradient-Type Algorithm for Bilevel Optimization with Inexact Lower-Level Solutions via Moreau Envelope-based Reformulation
by: Bai, Xiaoning, et al.
Published: (2024)

Optimality Conditions and Numerical Algorithms for a Class of Minimax Bilevel Optimization Problems
by: Hu, Yaling, et al.
Published: (2026)

Projected Subgradient Ascent for Convex Maximization
by: Felzenszwalb, Pedro, et al.
Published: (2025)

Convergence, Duality and Well-Posedness in Convex Bilevel Optimization
by: Giang-Tran, Khanh-Hung, et al.
Published: (2025)

Optimization Problems with Nearly Convex Objective Functions and Nearly Convex Constraint Sets
by: Thieu, Nguyen Nang, et al.
Published: (2026)

Asymmetric Long-Step Primal-Dual Interior-Point Methods with Dual Centering
by: Nesterov, Yurii
Published: (2025)

Existence of solutions for polyhedral convex set optimization problems
by: Löhne, Andreas
Published: (2023)

A solution method for arbitrary polyhedral convex set optimization problems
by: Löhne, Andreas
Published: (2023)

Modeling Adversarial Wildfires for Power Grid Disruption
by: Brun, Matthew, et al.
Published: (2026)

A Projection-Free Method for Solving Convex Bilevel Optimization Problems
by: Giang-Tran, Khanh-Hung, et al.
Published: (2023)

Automating Reformulation for Parallel ADMM
by: Sun, Kaizhao, et al.
Published: (2026)

Overcoming Lower-Level Constraints in Bilevel Optimization: A Novel Approach with Regularized Gap Functions
by: Yao, Wei, et al.
Published: (2024)

BattOpt: Optimal Facility Planning for Electric Vehicle Battery Recycling
by: Brun, Matthew, et al.
Published: (2024)

Mixed-Integer Linear Optimization for Cardinality-Constrained Random Forests
by: Burgard, Jan Pablo, et al.
Published: (2024)

Mixed-Integer Linear Optimization for Semi-Supervised Optimal Classification Trees
by: Burgard, Jan Pablo, et al.
Published: (2024)

Further Development in Convex Conic Reformulation of Geometric Nonconvex Conic Optimization Problems
by: Arima, Naohiko, et al.
Published: (2023)

Exact Convex Reformulations of Linear Neural Networks via Completely Positive Lifting
by: Prakhya, Karthik, et al.
Published: (2026)

Optimality conditions for bilevel programs via Moreau envelope reformulation
by: Bai, Kuang, et al.
Published: (2023)

Time-integrated Optimal Transport: A Robust Minimax Framework
by: Nguyen, Thai P. D., et al.
Published: (2025)

Commutation principles for nonsmooth variational problems on Euclidean Jordan algebras
by: Jeong, Juyoung, et al.
Published: (2024)

Error Bounds for a Class of Cone-Convex Inclusion Problems
by: Huy, Nguyen Quang, et al.
Published: (2025)

Swarm-Based Inertial Methods for Optimization
by: Wu, Qiyu, et al.
Published: (2026)

Identification of Active Subfunctions in Finite-Max Minimisation via a Smooth Reformulation
by: Ras, Charl, et al.
Published: (2024)

Lower Bound for a Polynomial on a product of hyperellipsoids using geometric programming
by: Ghasemi, Mehdi, et al.
Published: (2025)

Splitting Proximal Point Algorithms for the Sum of Prox-Convex Functions
by: de Brito, Jose, et al.
Published: (2026)

Riemannian Bilevel Optimization
by: Li, Jiaxiang, et al.
Published: (2024)

Extending Linear Convergence of the Proximal Point Algorithm: The Quasar-Convex Case
by: de Brito, José, et al.
Published: (2025)

Alternating Methods for Large-Scale AC Optimal Power Flow with Unit Commitment
by: Brun, Matthew, et al.
Published: (2025)

Lagrangian Reformulation for Nonconvex Optimization: Tailoring Problems to Specialized Solvers
by: Quintero, Rodolfo A., et al.
Published: (2024)

A Barrier Function Approach for Bilevel Optimization with Coupled Lower-Level Constraints: Formulation, Approximation and Algorithms
by: Jiang, Xiaotian, et al.
Published: (2024)

Lagrange Multipliers, Duality, and Sensitivity in Set-Valued Convex Programming via Pointed Closed Convex Processes
by: García-Castaño, Fernando, et al.
Published: (2024)

Interior-Point Algorithms for Monotone Linear Complementarity Problem Based on Different Predictor Directions
by: -Nagy, Marianna E., et al.
Published: (2025)

A Surrogate Value Function Formulation for Bilevel Optimization
by: Xu, Mengwei, et al.
Published: (2025)

Piecewise SOS-Convex Moment Optimization and Applications via Exact Semi-Definite Programs
by: Huang, Queenie Yingkun, et al.
Published: (2024)

A Symplectic Discretization Based Proximal Point Algorithm for Convex Minimization
by: Yuan, Ya-xiang, et al.
Published: (2024)

Extending Exact Convex Relaxations of Quadratically Constrained Quadratic Programs
by: Kojima, Masakazu, et al.
Published: (2025)

ZOBA: An Efficient Single-loop Zeroth-order Bilevel Optimization Algorithm
by: Rando, Marco, et al.
Published: (2026)

Optimality Conditions and Duality for Multiobjective Fractional Bilevel Optimization Problems
by: Lara, Felipe, et al.
Published: (2025)

Derivative-Free Bilevel Optimization with Inexact Lower-Level Solutions
by: Cesaroni, Edoardo, et al.
Published: (2026)

On Linear Threshold Policies for Continuous-Time Dynamic Yield Management
by: Banerjee, Dipayan, et al.
Published: (2024)