Complexity guarantees for an implicit smoothing-enabled method for stochastic MPECs
From MaRDI portal
Publication:2693641
Cites work
- scientific article; zbMATH DE number 4015993 (Why is no real title available?)
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 1113627 (Why is no real title available?)
- scientific article; zbMATH DE number 1971713 (Why is no real title available?)
- scientific article; zbMATH DE number 3065148 (Why is no real title available?)
- A Multiple Leader Stackelberg Model and Analysis
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- A Stochastic Approximation Method
- A bundle-free implicit programming approach for a class of elliptic MPECs in function space
- A mathematical programming approach for determining oligopolistic market equilibrium
- A method with convergence rates for optimization problems with variational inequality constraints
- A numerical approach to optimization problems with variational inequality constraints
- A polyhedral branch-and-cut approach to global optimization
- A smoothing method for mathematical programs with equilibrium constraints
- A stochastic multiple-leader Stackelberg model: analysis, computation, and application
- A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems
- A two-sided relaxation scheme for Mathematical Programs with Equilibrium Constraints
- An Implicit Programming Approach for a Class of Stochastic Mathematical Programs with Complementarity Constraints
- An Interior Point Method for Mathematical Programs with Complementarity Constraints (MPCCs)
- An MPEC approach to second-best toll pricing.
- An implicit formulation of mathematical program with complementarity constraints for application to robust structural optimization
- An implicit programming approach for the road pricing problem with nonadditive route costs
- Analysis on the forward market equilibrium model
- Approximating stationary points of stochastic mathematical programs with equilibrium constraints via sample averaging
- Characterizations of linear suboptimality for mathematical programs with equilibrium constraints
- Convergence analysis of a regularized sample average approximation method for stochastic mathematical programs with complementarity constraints
- Convex two-level optimization
- Decentralized Resource Allocation in Dynamic Networks of Agents
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- First-order methods in optimization
- Interior Methods for Mathematical Programs with Complementarity Constraints
- Introduction to Derivative-Free Optimization
- Introduction to nonlinear optimization: theory, algorithms, and applications with MATLAB
- Inverse truss design as a conic mathematical program with equilibrium constraints
- Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
- Mathematical Programs with Equilibrium Constraints
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- Mathematical programs with equilibrium constraints: automatic reformulation and solution via constrained optimization
- Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
- Multilevel optimization: algorithms and applications
- Nondifferential optimization via adaptive smoothing
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- On Optimization Problems with Variational Inequality Constraints
- On Using the Elastic Mode in Nonlinear Programming Approaches to Mathematical Programs with Complementarity Constraints
- On smoothing, regularization, and averaging in stochastic approximation methods for stochastic variational inequality problems
- On stochastic gradient and subgradient methods with adaptive steplength sequences
- On the analysis of variance-reduced and randomized projection variants of single projection schemes for monotone stochastic variational inequality problems
- Online convex optimization in the bandit setting: gradient descent without a gradient
- Optimization of lipschitz continuous functions
- Optimization problems with equilibrium constraints and their numerical solution.
- Random gradient-free minimization of convex functions
- Randomized smoothing for stochastic optimization
- Regularized mathematical programs with stochastic equilibrium constraints: estimating structural demand models
- Robust Stochastic Approximation Approach to Stochastic Programming
- Shape Optimization in Contact Problems with Coulomb Friction
- Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
- Smoothed Variable Sample-Size Accelerated Proximal Methods for Nonsmooth Stochastic Convex Programs
- Smoothing methods for nonsmooth, nonconvex minimization
- Solving stochastic mathematical programs with equilibrium constraints via approximation and smoothing implicit programming with penalization
- Solving variational inequalities with stochastic mirror-prox algorithm
- Stackelberg-Nash-Cournot Equilibria: Characterizations and Computations
- Stochastic Approximation Approaches to the Stochastic Variational Inequality Problem
- Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
- Stochastic mathematical programs with equilibrium constraints
- Stochastic mathematical programs with equilibrium constraints, modelling and sample average approximation
- Stochastic programming with equilibrium constraints
- Stochastic structural topology optimization: discretization and penalty function approach
- Stochastic variational inequalities: single-stage to multistage
- Variance-based extragradient methods with line search for stochastic variational inequalities
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)
