Combining approximation and exact penalty in hierarchical programming
DOI10.1080/02331934.2021.1939336zbMath1492.65174OpenAlexW3169372149MaRDI QIDQ5093688
Lorenzo Lampariello, Simone Sagratella, Giancarlo Bigi
Publication date: 1 August 2022
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2021.1939336
hierarchical programmingpenalty techniquesapproximation approachesoptimization problems with variational inequality constraints
Convex programming (90C25) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Numerical methods for variational inequalities and related problems (65K15)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A canonical duality approach for the solution of affine quasi-variational inequalities
- The semismooth Newton method for the solution of quasi-variational inequalities
- Sufficient conditions to compute any solution of a quasivariational inequality via a variational inequality
- Partial penalization for the solution of generalized Nash equilibrium problems
- Explicit hierarchical fixed point approach to variational inequalities
- Computing equilibria of Cournot oligopoly models with mixed-integer quantities
- On the computation of all solutions of jointly convex generalized Nash equilibrium problems
- A smoothing augmented Lagrangian method for solving simple bilevel programs
- Finite perturbation of convex programs
- Hybrid methods for a class of monotone variational inequalities
- Stability of regularized bilevel programming problems
- Foundations of bilevel programming
- A bridge between bilevel programs and Nash games
- Algorithms for generalized potential games with mixed-integer variables
- An explicit Tikhonov algorithm for nested variational inequalities
- Numerically tractable optimistic bilevel problems
- VI-constrained hemivariational inequalities: distributed algorithms and power control in ad-hoc networks
- Inertial projection-type methods for solving quasi-variational inequalities in real Hilbert spaces
- Feasible methods for nonconvex nonsmooth problems with applications in green communications
- On solving simple bilevel programs with a nonconvex lower level program
- Solving quasi-variational inequalities via their KKT conditions
- Computing All Solutions of Nash Equilibrium Problems with Discrete Strategy Sets
- Optimality Conditions for a Simple Convex Bilevel Programming Problem
- On the solution of the KKT conditions of generalized Nash equilibrium problems
- Approximation of two-person games with information exchange
- On Optimization Problems with Variational Inequality Constraints
- Variational Analysis
- Parallel Selective Algorithms for Nonconvex Big Data Optimization
- On generalized Nash equilibrium problems with linear coupling constraints and mixed-integer variables
- Parallel and Distributed Methods for Constrained Nonconvex Optimization—Part I: Theory
- Parallel and Distributed Methods for Constrained Nonconvex Optimization-Part II: Applications in Communications and Machine Learning
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity
- Regularization and Approximation Methods in Stackelberg Games and Bilevel Optimization
- The Standard Pessimistic Bilevel Problem
- A First Order Method for Solving Convex Bilevel Optimization Problems
- An inertial extrapolation method for convex simple bilevel optimization
This page was built for publication: Combining approximation and exact penalty in hierarchical programming
