Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
From MaRDI portal
Publication:288406
DOI10.1007/S10589-015-9810-0zbMATH Open1370.90278OpenAlexW2172583146MaRDI QIDQ288406FDOQ288406
Authors: Li-Ping Pang, Jian Lv, Jin-He Wang 
Publication date: 25 May 2016
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-015-9810-0
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
- Variational Analysis
- A Spectral Bundle Method for Semidefinite Programming
- Convex Analysis
- Methods of descent for nondifferentiable optimization
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- A proximal analytic center cutting plane algorithm for solving variational inequality problems
- Inexact bundle methods for two-stage stochastic programming
- Distributionally robust optimization under moment uncertainty with application to data-driven problems
- Title not available (Why is that?)
- Semi-Infinite Programming: Theory, Methods, and Applications
- Title not available (Why is that?)
- An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
- A Proximal Bundle Method with Approximate Subgradient Linearizations
- Divide to conquer: decomposition methods for energy optimization
- Semi-infinite programming
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- A bundle method for solving equilibrium problems
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- A smoothing projected Newton-type algorithm for semi-infinite programming
- First-order optimality conditions for two classes of generalized nonsmooth semi-infinite optimization
- 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
- Generalized semi-infinite optimization: A first order optimality condition and examples
- Locally Farkas-Minkowski linear inequality systems
- On the use of consistent approximations in the solution of semi-infinite optimization and optimal control problems
- Semismooth Newton methods for solving semi-infinite programming problems
- 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 smoothing Levenberg-Marquardt algorithm for semi-infinite programming
- A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems
- Nonsmooth semi-infinite programming problems with mixed constraints
- Incremental subgradient methods for nondifferentiable optimization
- Optimality conditions for non-smooth semi-infinite programming
- A new exchange method for convex semi-infinite programming
- Constrained bundle methods for upper inexact oracles with application to joint chance constrained energy problems
- An iterative method for solving KKT system of the semi-infinite programming
- An implementation of a discretization method for semi-infinite programming
- A cutting-plane method for quadratic semi infinite programming 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
- A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization
- Subdifferentials of nonconvex supremum functions and their applications to semi-infinite and infinite programs with Lipschitzian data
- Necessary optimality conditions for nonsmooth semi-infinite programming problems
- An Incremental Method for Solving Convex Finite Min-Max Problems
- Lagrange Multipliers in Nonsmooth Semi-Infinite Optimization Problems
- A Bundle Method for a Class of Bilevel Nonsmooth Convex Minimization Problems
- A Truncated Projected Newton-Type Algorithm for Large-Scale Semi-infinite Programming
- 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
- On constraint qualifications in nonsmooth optimization.
- A partially inexact bundle method for convex semi-infinite minmax problems
- A one-phase algorithm for semi-infinite linear programming
- A new smoothing Newton-type algorithm for semi-infinite programming
- Incremental-like bundle methods with application to energy planning
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
- An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information
- A partially inexact bundle method for convex semi-infinite minmax problems
- 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
- A class of infeasible proximal bundle methods for nonsmooth nonconvex multi-objective optimization problems
- Multiobjective optimization under uncertainty: a multiobjective robust (relative) regret approach
- 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)
