On solving the convex semi-infinite minimax problems via superlinear VU incremental bundle technique with partial inexact oracle
From MaRDI portal
Publication:5024906
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
Cites work
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 3870083 (Why is no real title available?)
- scientific article; zbMATH DE number 1070896 (Why is no real title available?)
- scientific article; zbMATH DE number 1424528 (Why is no real title available?)
- scientific article; zbMATH DE number 7313894 (Why is no real title available?)
- A Bundle Method for Solving Variational Inequalities
- A Bundle Method for a Class of Bilevel Nonsmooth Convex Minimization Problems
- A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
- A Proximal Bundle Method with Approximate Subgradient Linearizations
- A Spectral Bundle Method for Semidefinite Programming
- A \(\mathcal{VU}\)-algorithm for convex minimization
- A bundle method for solving equilibrium problems
- A fast space-decomposition scheme for nonconvex eigenvalue optimization
- A globally convergent SQP method for semi-infinite nonlinear optimization
- A new exchange method for convex semi-infinite programming
- A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems
- A one-phase algorithm for semi-infinite linear programming
- A partially inexact bundle method for convex semi-infinite minmax problems
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
- A second-order bundle method based on \(\mathcal{UV}\)-decomposition strategy for a special class of eigenvalue optimizations
- A second-order bundle method to minimize the maximum eigenvalue function.
- A smoothing Newton method for semi-infinite programming
- A space decomposition scheme for maximum eigenvalue functions and its applications
- An Incremental Method for Solving Convex Finite Min-Max Problems
- An algorithm for optimization problems with functional inequality constraints
- Bi-level strategies in semi-infinite programming.
- Computational discretization algorithms for functional inequality constrained optimization
- Constrained bundle methods for upper inexact oracles with application to joint chance constrained energy problems
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- Convex Analysis
- Decomposition into functions in the minimization problem
- Discretization in semi-infinite programming: the rate of convergence
- Divide to conquer: decomposition methods for energy optimization
- Dynamic optimization for switched time-delay systems with state-dependent switching conditions
- Global solution of semi-infinite programs
- Incremental subgradient methods for nondifferentiable optimization
- Incremental-like bundle methods with application to energy planning
- Inexact bundle methods for two-stage stochastic programming
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- Necessary optimality conditions for nonsmooth semi-infinite programming problems
- On \(\mathcal{VU}\)-theory for functions with primal-dual gradient structure
- On some applications of LSIP to probability and statistics.
- Optimization. Algorithms and consistent approximations
- Primal-Dual Gradient Structured Functions: Second-Order Results; Links to Epi-Derivatives and Partly Smooth Functions
- Proximity control in bundle methods for convex nondifferentiable minimization
- 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
- Semi-Infinite Programming: Theory, Methods, and Applications
- Semi-infinite programming
- Semi-infinite programming. Recent advances
- Semi-infinite programming. Workshop, Cottbus, Germany, September 1996
- Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method
- Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme
- Solving semi-infinite programs by smoothing projected gradient method
- Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization
- Stability of indices in the KKT conditions and metric regularity in convex semi-infinite optimization
- The $\U$-Lagrangian of the Maximum Eigenvalue Function
- The space decomposition theory for a class of eigenvalue optimizations
- The 𝒰-Lagrangian of a convex function
- Theory and applications of robust optimization
- Variational Analysis
Cited in
(6)- Proximal decomposition of convex optimization via an alternating linearization algorithm with inexact oracles
- A superlinear \(\mathcal{VU}\) space-decomposition algorithm for semi-infinite constrained programming
- An Incremental Method for Solving Convex Finite Min-Max Problems
- A proximal-projection partial bundle method for convex constrained minimax problems
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
- A partially inexact bundle method for convex semi-infinite minmax problems
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)
