Pages that link to "Item:Q4277519"

The following pages link to A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems (Q4277519):

Displaying 28 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)
• An inexact primal-dual algorithm for semi-infinite programming (Q784788) (← links)
• The CoMirror algorithm with random constraint sampling for convex semi-infinite programming (Q828836) (← links)
• A multiperiod planning model for communications satellites (Q1207063) (← links)
• A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information (Q1704913) (← links)
• An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems (Q1717575) (← links)
• An accelerated central cutting plane algorithm for linear semi-infinite programming (Q1764241) (← links)
• A logarithmic barrier cutting plane method for convex programming (Q1904709) (← links)
• A globally convergent method for semi-infinite linear programming (Q1924071) (← links)
• An entropy based central cutting plane algorithm for convex min-Max semi-infinite programming problems (Q1935707) (← links)
• On the numerical treatment of linearly constrained semi-infinite optimization problems (Q1969893) (← links)
• A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods (Q1986106) (← links)
• Distributionally robust resource planning under binomial demand intakes (Q2106736) (← links)
• A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming (Q2129642) (← 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)
• Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models (Q2424760) (← links)
• An exchange method with refined subproblems for convex semi-infinite programming problems (Q2829588) (← links)
• An outer approximation algorithm for equilibrium problems in Hilbert spaces (Q2943825) (← links)
• Logarithmic Barrier Decomposition Methods for Semi-infinite Programming (Q3842985) (← links)
• A dual parameterization approach to linear-quadratic semi-infinite programming problems (Q4242974) (← 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)
• Learning Data Manifolds with a Cutting Plane Method (Q5157241) (← links)
• Semi-Infinite Programming using High-Degree Polynomial Interpolants and Semidefinite Programming (Q5355202) (← links)
• A modified exchange algorithm for distributional robust optimization and applications in risk management (Q6092503) (← links)