Pages that link to "Item:Q5955561"

The following pages link to Discretization in semi-infinite programming: the rate of convergence (Q5955561):

Displaying 50 items.

• Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems (Q288406) (← links)
• Scenario approximation of robust and chance-constrained programs (Q368719) (← links)
• On the convergence of a smoothed penalty algorithm for semi-infinite programming (Q376724) (← 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)
• Semi-infinite programming (Q869581) (← links)
• On generalized semi-infinite programming. (With comments and rejoinder). (Q874881) (← links)
• Generalized semi-infinite programming: a tutorial (Q929611) (← links)
• A semi-infinite programming algorithm for solving optimal power flow with transient stability constraints (Q929614) (← links)
• New approach for the nonlinear programming with transient stability constraints arising from power systems (Q967215) (← links)
• A new smoothing Newton-type algorithm for semi-infinite programming (Q969747) (← links)
• A smoothing projected Newton-type algorithm for semi-infinite programming (Q1001204) (← links)
• A filter trust region method for solving semi-infinite programming problems (Q1032551) (← links)
• Convex semi-infinite parametric programming: Uniform convergence of the optimal value functions of discretized problems (Q1293961) (← links)
• Discretization methods for the solution of semi-infinite programming problems (Q1321097) (← links)
• An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems (Q1717575) (← links)
• Filter trust region method for nonlinear semi-infinite programming problem (Q1720831) (← links)
• A noninterior point homotopy method for semi-infinite programming problems (Q1743361) (← links)
• Uncertain convex programs: randomized solutions and confidence levels (Q1769067) (← links)
• Discretization method for semi-definite programming (Q1770709) (← links)
• A new proof of the strong duality theorem for semidefinite programming (Q1771002) (← links)
• Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems (Q1935267) (← links)
• A lifting method for generalized semi-infinite programs based on lower level Wolfe duality (Q1938906) (← links)
• Rejoinder on: Stability in linear optimization and related topics. A personal tour (Q1939066) (← links)
• An augmented Lagrangian algorithm for solving semiinfinite programming (Q1952762) (← links)
• A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods (Q1986106) (← links)
• An interior point sequential quadratic programming-type method for log-determinant semi-infinite programs (Q1987416) (← links)
• Near-optimal solutions of convex semi-infinite programs via targeted sampling (Q2095909) (← links)
• A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming (Q2129642) (← links)
• Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization (Q2168048) (← links)
• Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables (Q2168050) (← links)
• Lipschitz modulus of linear and convex inequality systems with the Hausdorff metric (Q2230933) (← links)
• An improved bootstrap test for restricted stochastic dominance (Q2236873) (← links)
• Multiobjective optimization under uncertainty: a multiobjective robust (relative) regret approach (Q2239941) (← links)
• A standard branch-and-bound approach for nonlinear semi-infinite problems (Q2282532) (← links)
• A smoothing Levenberg-Marquardt algorithm for semi-infinite programming (Q2352422) (← links)
• Existence of augmented Lagrange multipliers for semi-infinite programming problems (Q2363568) (← links)
• A nonsmooth Levenberg-Marquardt method for solving semi-infinite programming problems (Q2390009) (← links)
• Computation algorithm for convex semi-infinite program with second-order cones: special analyses for affine and quadratic case (Q2399192) (← links)
• Nonlinear robust optimization via sequential convex bilevel programming (Q2434994) (← links)
• Copositive programming via semi-infinite optimization (Q2435031) (← links)
• A transformation-based discretization method for solving general semi-infinite optimization problems (Q2661756) (← links)
• An exchange method with refined subproblems for convex semi-infinite programming problems (Q2829588) (← links)
• A smoothing approach for the optimal parameter selection problem with continuous inequality constraint (Q2867401) (← links)
• A fast algorithm for the optimal design of high accuracy windows in signal processing (Q2867415) (← links)
• Towards rigorous robust optimal control via generalized high-order moment expansion (Q3176438) (← links)
• No-arbitrage bounds for the forward smile given marginals (Q4555138) (← links)
• On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle (Q5024906) (← links)