Discretization in semi-infinite programming: the rate of convergence
From MaRDI portal
Recommendations
- Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems
- Discretization methods for the solution of semi-infinite programming problems
- Rate-Preserving Discretization Strategies for Semi-Infinite Programming and Optimal Control
- An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence
- An implementation of a discretization method for semi-infinite programming
Cited in
(61)- A smoothing projected Newton-type algorithm for semi-infinite programming
- A filter trust region method for solving semi-infinite programming problems
- Convex semi-infinite parametric programming: Uniform convergence of the optimal value functions of discretized problems
- Discretization methods for the solution of semi-infinite programming problems
- An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems
- Filter trust region method for nonlinear semi-infinite programming problem
- A noninterior point homotopy method for semi-infinite programming problems
- Uncertain convex programs: randomized solutions and confidence levels
- Discretization method for semi-definite programming
- A new proof of the strong duality theorem for semidefinite programming
- Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems
- A lifting method for generalized semi-infinite programs based on lower level Wolfe duality
- Rejoinder on: Stability in linear optimization and related topics. A personal tour
- An augmented Lagrangian algorithm for solving semiinfinite programming
- A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods
- An interior point sequential quadratic programming-type method for log-determinant semi-infinite programs
- Near-optimal solutions of convex semi-infinite programs via targeted sampling
- A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming
- Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization
- Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables
- Lipschitz modulus of linear and convex inequality systems with the Hausdorff metric
- An improved bootstrap test for restricted stochastic dominance
- Multiobjective optimization under uncertainty: a multiobjective robust (relative) regret approach
- A standard branch-and-bound approach for nonlinear semi-infinite problems
- A smoothing Levenberg-Marquardt algorithm for semi-infinite programming
- Existence of augmented Lagrange multipliers for semi-infinite programming problems
- A nonsmooth Levenberg-Marquardt method for solving semi-infinite programming problems
- Computation algorithm for convex semi-infinite program with second-order cones: special analyses for affine and quadratic case
- Nonlinear robust optimization via sequential convex bilevel programming
- Copositive programming via semi-infinite optimization
- A transformation-based discretization method for solving general semi-infinite optimization problems
- An exchange method with refined subproblems for convex semi-infinite programming problems
- A smoothing approach for the optimal parameter selection problem with continuous inequality constraint
- A fast algorithm for the optimal design of high accuracy windows in signal processing
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
- Towards rigorous robust optimal control via generalized high-order moment expansion
- Scenario approximation of robust and chance-constrained programs
- On the convergence of a smoothed penalty algorithm for semi-infinite programming
- Rate-Preserving Discretization Strategies for Semi-Infinite Programming and Optimal Control
- No-arbitrage bounds for the forward smile given marginals
- Solving semi-infinite programs by smoothing projected gradient method
- On solving the convex semi-infinite minimax problems via superlinear \(\mathcal{VU}\) incremental bundle technique with partial inexact oracle
- Convergent Algorithms for a Class of Convex Semi-infinite Programs
- An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence
- Semi-infinite programming using high-degree polynomial interpolants and semidefinite programming
- Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints
- A modified exchange algorithm for distributional robust optimization and applications in risk management
- Copositive tensor optimization problem and its applications to hypergraphs
- On the convergence of local solutions for the method quADAPT
- Bounding-focused discretization methods for the global optimization of nonconvex semi-infinite programs
- Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems
- Convex semi-infinite programming algorithms with inexact separation oracles
- Derivative-enhanced lower-Bounding in adaptive discretization for the global solution of semi-infinite optimization problems
- An inexact primal-dual algorithm for semi-infinite programming
- The CoMirror algorithm with random constraint sampling for convex semi-infinite programming
- Semi-infinite programming
- On generalized semi-infinite programming. (With comments and rejoinder).
- Generalized semi-infinite programming: a tutorial
- A semi-infinite programming algorithm for solving optimal power flow with transient stability constraints
- New approach for the nonlinear programming with transient stability constraints arising from power systems
- A new smoothing Newton-type algorithm for semi-infinite programming
This page was built for publication: Discretization in semi-infinite programming: the rate of convergence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5955561)
