On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle
From MaRDI portal
Publication:5024906
DOI10.1142/S0217595921400157zbMath1484.90129OpenAlexW3138692071MaRDI QIDQ5024906
Si-Da Lin, Chongyang Liu, Xi-Jun Liang, Jinlong Yuan, Ming Huang
Publication date: 1 February 2022
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595921400157
nonsmooth optimizationconvex optimizationsuperlinear convergencebundle method\(\mathcal{VU}\)-decompositionsemi-infinite minimax programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
- The space decomposition theory for a class of eigenvalue optimizations
- Solving semi-infinite programs by smoothing projected gradient method
- A fast space-decomposition scheme for nonconvex eigenvalue optimization
- Necessary optimality conditions for nonsmooth semi-infinite programming problems
- Divide to conquer: decomposition methods for energy optimization
- Semi-infinite programming
- A partially inexact bundle method for convex semi-infinite minmax problems
- A one-phase algorithm for semi-infinite linear programming
- Proximity control in bundle methods for convex nondifferentiable minimization
- A bundle method for solving equilibrium problems
- Incremental-like bundle methods with application to energy planning
- Stability of indices in the KKT conditions and metric regularity in convex semi-infinite optimization
- Decomposition into functions in the minimization problem
- A globally convergent SQP method for semi-infinite nonlinear optimization
- Optimization. Algorithms and consistent approximations
- Semi-infinite programming. Workshop, Cottbus, Germany, September 1996
- Bi-level strategies in semi-infinite programming.
- Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization
- A smoothing Newton method for semi-infinite programming
- Global solution of semi-infinite programs
- Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method
- Relaxed cutting plane method for solving linear semi-infinite programming problems
- Robust multi-objective optimal switching control arising in 1,3-propanediol microbial fed-batch process
- A space decomposition scheme for maximum eigenvalue functions and its applications
- A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems
- A \(\mathcal{VU}\)-algorithm for convex minimization
- On $\mathcalVU$-theory for Functions with Primal-Dual Gradient Structure
- Incremental Subgradient Methods for Nondifferentiable Optimization
- A New Exchange Method for Convex Semi-Infinite Programming
- Inexact Bundle Methods for Two-Stage Stochastic Programming
- Theory and Applications of Robust Optimization
- Semi-Infinite Programming: Theory, Methods, and Applications
- A Second-Order Bundle Method Based on -Decomposition Strategy for a Special Class of Eigenvalue Optimizations
- Constrained Bundle Methods for Upper Inexact Oracles with Application to Joint Chance Constrained Energy Problems
- An algorithm for optimization problems with functional inequality constraints
- A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
- Variational Analysis
- Primal-Dual Gradient Structured Functions: Second-Order Results; Links to Epi-Derivatives and Partly Smooth Functions
- A Spectral Bundle Method for Semidefinite Programming
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- A Bundle Method for Solving Variational Inequalities
- Dynamic Optimization for Switched Time-Delay Systems with State-Dependent Switching Conditions
- The 𝒰-Lagrangian of a convex function
- The $\U$-Lagrangian of the Maximum Eigenvalue Function
- An Incremental Method for Solving Convex Finite Min-Max Problems
- A Bundle Method for a Class of Bilevel Nonsmooth Convex Minimization Problems
- A Proximal Bundle Method with Approximate Subgradient Linearizations
- Convex Analysis
- A second-order bundle method to minimize the maximum eigenvalue function.
- Computational discretization algorithms for functional inequality constrained optimization
- Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme
- Semi-infinite programming. Recent advances
- Discretization in semi-infinite programming: the rate of convergence
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
