Pages that link to "Item:Q1963110"
From MaRDI portal
The following pages link to Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method (Q1963110):
Displaying 12 items.
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems (Q288406) (← links)
- Solving semi-infinite programs by smoothing projected gradient method (Q480937) (← links)
- Some properties on quadratic infinite programs of integral type (Q879002) (← links)
- A sequential quadratic programming with a dual parametrization approach to nonlinear semi-infinite programming (Q1433470) (← links)
- Linear semi-infinite programming theory: an updated survey (Q1848390) (← links)
- An entropy based central cutting plane algorithm for convex min-Max semi-infinite programming problems (Q1935707) (← links)
- Global convergence of a class of smooth penalty methods for semi-infinite programming (Q1937778) (← links)
- A smoothing Levenberg-Marquardt algorithm for semi-infinite programming (Q2352422) (← links)
- Computation algorithm for convex semi-infinite program with second-order cones: special analyses for affine and quadratic case (Q2399192) (← links)
- Tight Bounds for Cost-Sharing in Weighted Congestion Games (Q3449511) (← links)
- A quasi-Newton interior point method for semi-infinite programming (Q4650627) (← links)
- On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle (Q5024906) (← links)
