Pages that link to "Item:Q5936072"
From MaRDI portal
The following pages link to Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme (Q5936072):
Displaying 15 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)
- Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems (Q694542) (← links)
- A class of comprehensive constraints for design of PCWLSE Laguerre and FIR filters: a boost in performance (Q1957224) (← links)
- Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method (Q1963110) (← links)
- Relaxed cutting plane method for solving linear semi-infinite programming problems (Q1969533) (← links)
- Detecting and solving aircraft conflicts using bilevel programming (Q2231332) (← links)
- Non-convex semi-infinite min-max optimization with noncompact sets (Q2411166) (← links)
- Algorithms for infinite quadratic programming in \(L_p\) spaces (Q2479348) (← links)
- A relaxed cutting plane method for semi-infinite semi-definite programming (Q2503018) (← links)
- A solution method for combined semi-infinite and semi-definite programming (Q4831772) (← links)
- On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle (Q5024906) (← links)
- Convergent Algorithms for a Class of Convex Semi-infinite Programs (Q5043283) (← links)
- Convex Optimization for Group Feature Selection in Networked Data (Q5139860) (← links)
- Learning Data Manifolds with a Cutting Plane Method (Q5157241) (← links)
