An approximate bundle method for solving nonsmooth equilibrium problems
From MaRDI portal
Publication:2399480
DOI10.1007/s10898-016-0490-9zbMath1369.90123OpenAlexW2570881040MaRDI QIDQ2399480
Jian Lv, Jin-He Wang, Fan-Yun Meng, Li-Ping Pang
Publication date: 24 August 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-016-0490-9
Related Items
A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming, A class of infeasible proximal bundle methods for nonsmooth nonconvex multi-objective optimization problems, An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information, A Proximal Bundle Method with Exact Penalty Technique and Bundle Modification Strategy for Nonconvex Nonsmooth Constrained Optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
- Lipschitz continuity of an approximate solution mapping to equilibrium problems
- Constrained nonconvex nonsmooth optimization via proximal bundle method
- Optimization tools for solving equilibrium problems with nonsmooth data
- An inexact subgradient algorithm for equilibrium problems
- On approximations with finite precision in bundle methods for nonsmooth optimization
- Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs
- Hybrid proximal methods for equilibrium problems
- On Nash-Cournot oligopolistic market equilibrium models with concave cost functions
- A bundle-type auxiliary problem method for solving generalized variational-like inequalities
- A bundle method for solving equilibrium problems
- Incremental-like bundle methods with application to energy planning
- Convergence of some algorithms for convex minimization
- A nonsmooth Newton method for variational inequalities. II: Numerical results
- The application of a linearization method to solve nonsmooth equilibrium problems
- Combined relaxation methods for variational inequalities
- Two new self-adaptive projection methods for variational inequality problems
- Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization
- New existence results for equilibrium problems
- A double projection method for solving variational inequalities without monotonicity
- On the proximal point method for equilibrium problems in Hilbert spaces
- Inexact Bundle Methods for Two-Stage Stochastic Programming
- An Algorithm for Nonsmooth Convex Minimization With Errors
- A Bundle Method for Solving Variational Inequalities
- Iterative Algorithms for Equilibrium Problems
- Co-Coercivity and Its Role in the Convergence of Iterative Schemes for Solving Variational Inequalities
- Projected Reflected Gradient Methods for Monotone Variational Inequalities
- A Proximal Bundle Method with Approximate Subgradient Linearizations
- A proximal bundle method based on approximate subgradients
- A new version of extragradient method for variational inequality problems
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
