Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems

Recommendations

An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems
A bundle method for solving nonsmooth convex semi-infinite programming with inexact information
A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming
On solving the convex semi-infinite minimax problems via superlinear \(\mathcal{VU}\) incremental bundle technique with partial inexact oracle
A partially inexact bundle method for convex semi-infinite minmax problems

Cites work

scientific article; zbMATH DE number 439380 (Why is no real title available?)
scientific article; zbMATH DE number 1070896 (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 Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization
A Proximal Bundle Method with Approximate Subgradient Linearizations
A Spectral Bundle Method for Semidefinite Programming
A Truncated Projected Newton-Type Algorithm for Large-Scale Semi-infinite Programming
A bundle method for solving equilibrium problems
A cutting-plane method for quadratic semi infinite programming problems
A globally convergent SQP method for semi-infinite nonlinear optimization
A new exchange method for convex semi-infinite programming
A new smoothing Newton-type algorithm for 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 analytic center cutting plane algorithm for solving variational inequality problems
A proximal bundle method for nonsmooth nonconvex functions with inexact information
A smoothing Levenberg-Marquardt algorithm for semi-infinite programming
A smoothing Newton method for semi-infinite programming
A smoothing projected Newton-type algorithm for semi-infinite programming
An Incremental Method for Solving Convex Finite Min-Max Problems
An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
An implementation of a discretization method for semi-infinite programming
An iterative method for solving KKT system of the 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
Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
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
Distributionally robust optimization under moment uncertainty with application to data-driven problems
Divide to conquer: decomposition methods for energy optimization
First-order optimality conditions for two classes of generalized nonsmooth semi-infinite optimization
Generalized semi-infinite optimization: A first order optimality condition and examples
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
Lagrange Multipliers in Nonsmooth Semi-Infinite Optimization Problems
Locally Farkas-Minkowski linear inequality systems
Methods of descent for nondifferentiable optimization
Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
Necessary optimality conditions for nonsmooth semi-infinite programming problems
Nonsmooth semi-infinite programming problems with mixed constraints
On constraint qualifications in nonsmooth optimization.
On the use of consistent approximations in the solution of semi-infinite optimization and optimal control problems
Optimality conditions for non-smooth semi-infinite programming
Relaxed cutting plane method for solving linear semi-infinite programming problems
Semi-Infinite Programming: Theory, Methods, and Applications
Semi-infinite programming
Semismooth Newton methods for solving semi-infinite programming problems
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
Subdifferentials of nonconvex supremum functions and their applications to semi-infinite and infinite programs with Lipschitzian data
Variational Analysis

Cited in

(17)

A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods
The CoMirror algorithm with random constraint sampling for convex semi-infinite programming
A new approach for nonconvex SIP
Modified gradient sampling algorithm for nonsmooth semi-infinite programming
A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming
A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
The radius of robust feasibility of uncertain mathematical programs: a survey and recent developments
A bundle method for solving nonsmooth convex semi-infinite programming with inexact information
A partially inexact bundle method for convex semi-infinite minmax problems
An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information
An approximate bundle method for solving nonsmooth equilibrium problems
A new restricted memory level bundle method for constrained convex nonsmooth optimization
A multi-step doubly stabilized bundle method for nonsmooth convex optimization
Multiobjective optimization under uncertainty: a multiobjective robust (relative) regret approach
A class of infeasible proximal bundle methods for nonsmooth nonconvex multi-objective optimization problems
On solving the convex semi-infinite minimax problems via superlinear \(\mathcal{VU}\) incremental bundle technique with partial inexact oracle
An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems

This page was built for publication: Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q288406)