Pages that link to "Item:Q480937"
From MaRDI portal
The following pages link to Solving semi-infinite programs by smoothing projected gradient method (Q480937):
Displaying 17 items.
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems (Q288406) (← links)
- The CoMirror algorithm with random constraint sampling for convex semi-infinite programming (Q828836) (← links)
- A smoothing projected Newton-type algorithm for semi-infinite programming (Q1001204) (← links)
- A smoothing approach for semi-infinite programming with projected Newton-type algorithm (Q1013456) (← links)
- Optimality conditions for semi-infinite programming problems involving generalized convexity (Q1733329) (← links)
- A noninterior point homotopy method for semi-infinite programming problems (Q1743361) (← links)
- An entropy based central cutting plane algorithm for convex min-Max semi-infinite programming problems (Q1935707) (← links)
- Decomposition algorithms for some deterministic and two-stage stochastic single-leader multi-follower games (Q2028466) (← links)
- Distributionally robust optimization. A review on theory and applications (Q2074636) (← links)
- A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming (Q2129642) (← links)
- Finite-sum smooth optimization with SARAH (Q2149950) (← links)
- Frameworks and results in distributionally robust optimization (Q2165596) (← links)
- An incremental bundle method for portfolio selection problem under second-order stochastic dominance (Q2200800) (← links)
- Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models (Q2424760) (← links)
- On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle (Q5024906) (← links)
- Gradient-Based Solution Algorithms for a Class of Bilevel Optimization and Optimal Control Problems with a Nonsmooth Lower Level (Q5211812) (← links)
- Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints (Q6038645) (← links)
