On solving the convex semi-infinite minimax problems via superlinear VU incremental bundle technique with partial inexact oracle
From MaRDI portal
Publication:5024906
DOI10.1142/S0217595921400157zbMATH Open1484.90129OpenAlexW3138692071MaRDI QIDQ5024906FDOQ5024906
Authors: Ming Huang, Jinlong Yuan, Sida Lin, X.-J. Liang, Chongyang Liu 
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
Recommendations
- A partially inexact bundle method for convex semi-infinite minmax problems
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
- A bundle method for solving nonsmooth convex semi-infinite programming with inexact information
- A proximal-projection partial bundle method for convex constrained minimax problems
- A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming
convex optimizationnonsmooth optimizationsuperlinear convergencebundle method\(\mathcal{VU}\)-decompositionsemi-infinite minimax programming
Cites Work
- Variational Analysis
- A Spectral Bundle Method for Semidefinite Programming
- Convex Analysis
- Optimization. Algorithms and consistent approximations
- Theory and applications of robust optimization
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- Proximity control in bundle methods for convex nondifferentiable minimization
- Semi-infinite programming. Workshop, Cottbus, Germany, September 1996
- Bi-level strategies in semi-infinite programming.
- Inexact bundle methods for two-stage stochastic programming
- Title not available (Why is that?)
- Semi-Infinite Programming: Theory, Methods, and Applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Proximal Bundle Method with Approximate Subgradient Linearizations
- Semi-infinite programming. Recent advances
- Divide to conquer: decomposition methods for energy optimization
- Semi-infinite programming
- A bundle method for solving equilibrium problems
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- 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
- 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
- A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems
- Incremental subgradient methods for nondifferentiable optimization
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
- A new exchange method for convex semi-infinite programming
- Constrained Bundle Methods for Upper Inexact Oracles with Application to Joint Chance Constrained Energy Problems
- A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
- A Bundle Method for Solving Variational Inequalities
- Solving semi-infinite programs by smoothing projected gradient method
- Necessary optimality conditions for nonsmooth semi-infinite programming problems
- An Incremental Method for Solving Convex Finite Min-Max Problems
- A Bundle Method for a Class of Bilevel Nonsmooth Convex Minimization Problems
- Computational discretization algorithms for functional inequality constrained optimization
- Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme
- Discretization in semi-infinite programming: the rate of convergence
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
- A partially inexact bundle method for convex semi-infinite minmax problems
- A one-phase algorithm for semi-infinite linear programming
- Incremental-like bundle methods with application to energy planning
- A \(\mathcal{VU}\)-algorithm for convex minimization
- The 𝒰-Lagrangian of a convex function
- On \(\mathcal{VU}\)-theory for functions with primal-dual gradient structure
- An algorithm for optimization problems with functional inequality constraints
- Primal-Dual Gradient Structured Functions: Second-Order Results; Links to Epi-Derivatives and Partly Smooth Functions
- A second-order bundle method to minimize the maximum eigenvalue function.
- Title not available (Why is that?)
- A space decomposition scheme for maximum eigenvalue functions and its applications
- The space decomposition theory for a class of eigenvalue optimizations
- The $\U$-Lagrangian of the Maximum Eigenvalue Function
- Title not available (Why is that?)
- A fast space-decomposition scheme for nonconvex eigenvalue optimization
- Robust multi-objective optimal switching control arising in 1,3-propanediol microbial fed-batch process
- On some applications of LSIP to probability and statistics.
- Dynamic Optimization for Switched Time-Delay Systems with State-Dependent Switching Conditions
- A Second-Order Bundle Method Based on -Decomposition Strategy for a Special Class of Eigenvalue Optimizations
Cited In (3)
This page was built for publication: On solving the convex semi-infinite minimax problems via superlinear \(\mathcal{VU}\) incremental bundle technique with partial inexact oracle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5024906)
