Complexity guarantees for an implicit smoothing-enabled method for stochastic MPECs
DOI10.1007/S10107-022-01893-6OpenAlexW3155757949MaRDI QIDQ2693641FDOQ2693641
Authors: Shisheng Cui, Uday V. Shanbhag, Farzad Yousefian
Publication date: 24 March 2023
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.08406
Nonlinear programming (90C30) Stochastic programming (90C15) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Numerical methods for variational inequalities and related problems (65K15)
Cites Work
- Mathematical programs with equilibrium constraints: automatic reformulation and solution via constrained optimization
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- First-order methods in optimization
- A Stochastic Approximation Method
- Robust Stochastic Approximation Approach to Stochastic Programming
- Title not available (Why is that?)
- On stochastic gradient and subgradient methods with adaptive steplength sequences
- Smoothing methods for nonsmooth, nonconvex minimization
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- A bundle-free implicit programming approach for a class of elliptic MPECs in function space
- Title not available (Why is that?)
- Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
- Mathematical Programs with Equilibrium Constraints
- A smoothing method for mathematical programs with equilibrium constraints
- A polyhedral branch-and-cut approach to global optimization
- Random gradient-free minimization of convex functions
- Online convex optimization in the bandit setting: gradient descent without a gradient
- Title not available (Why is that?)
- Stochastic mathematical programs with equilibrium constraints, modelling and sample average approximation
- Stochastic Approximation Approaches to the Stochastic Variational Inequality Problem
- Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
- A two-sided relaxation scheme for Mathematical Programs with Equilibrium Constraints
- Interior Methods for Mathematical Programs with Complementarity Constraints
- Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
- An MPEC approach to second-best toll pricing.
- Multilevel optimization: algorithms and applications
- Introduction to Derivative-Free Optimization
- Optimization of lipschitz continuous functions
- Solving variational inequalities with stochastic mirror-prox algorithm
- Nondifferential optimization via adaptive smoothing
- Title not available (Why is that?)
- Convex two-level optimization
- Introduction to nonlinear optimization: theory, algorithms, and applications with MATLAB
- A stochastic multiple-leader Stackelberg model: analysis, computation, and application
- Title not available (Why is that?)
- Stochastic mathematical programs with equilibrium constraints
- Stochastic programming with equilibrium constraints
- Stackelberg-Nash-Cournot Equilibria: Characterizations and Computations
- Solving stochastic mathematical programs with equilibrium constraints via approximation and smoothing implicit programming with penalization
- On Using the Elastic Mode in Nonlinear Programming Approaches to Mathematical Programs with Complementarity Constraints
- A Multiple Leader Stackelberg Model and Analysis
- A mathematical programming approach for determining oligopolistic market equilibrium
- On Optimization Problems with Variational Inequality Constraints
- An Implicit Programming Approach for a Class of Stochastic Mathematical Programs with Complementarity Constraints
- Decentralized Resource Allocation in Dynamic Networks of Agents
- Shape Optimization in Contact Problems with Coulomb Friction
- Stochastic structural topology optimization: discretization and penalty function approach
- Stochastic variational inequalities: single-stage to multistage
- Characterizations of linear suboptimality for mathematical programs with equilibrium constraints
- An Interior Point Method for Mathematical Programs with Complementarity Constraints (MPCCs)
- Convergence analysis of a regularized sample average approximation method for stochastic mathematical programs with complementarity constraints
- Approximating stationary points of stochastic mathematical programs with equilibrium constraints via sample averaging
- Optimization problems with equilibrium constraints and their numerical solution.
- Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
- Randomized smoothing for stochastic optimization
- Analysis on the forward market equilibrium model
- A numerical approach to optimization problems with variational inequality constraints
- An implicit programming approach for the road pricing problem with nonadditive route costs
- Regularized mathematical programs with stochastic equilibrium constraints: estimating structural demand models
- On smoothing, regularization, and averaging in stochastic approximation methods for stochastic variational inequality problems
- Variance-based extragradient methods with line search for stochastic variational inequalities
- Smoothed Variable Sample-Size Accelerated Proximal Methods for Nonsmooth Stochastic Convex Programs
- On the analysis of variance-reduced and randomized projection variants of single projection schemes for monotone stochastic variational inequality problems
- A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems
- An implicit formulation of mathematical program with complementarity constraints for application to robust structural optimization
- Inverse truss design as a conic mathematical program with equilibrium constraints
- A method with convergence rates for optimization problems with variational inequality constraints
Cited In (1)
Uses Software
This page was built for publication: Complexity guarantees for an implicit smoothing-enabled method for stochastic MPECs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2693641)