Discretization in semi-infinite programming: the rate of convergence
From MaRDI portal
Publication:5955561
DOI10.1007/s101070100239zbMath1051.90023OpenAlexW177890044MaRDI QIDQ5955561
No author found.
Publication date: 2001
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070100239
Related Items (54)
Existence of augmented Lagrange multipliers for semi-infinite programming problems ⋮ The CoMirror algorithm with random constraint sampling for convex semi-infinite programming ⋮ A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming ⋮ Convergent Algorithms for a Class of Convex Semi-infinite Programs ⋮ 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 ⋮ No-arbitrage bounds for the forward smile given marginals ⋮ 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 ⋮ 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 ⋮ Scenario approximation of robust and chance-constrained programs ⋮ On generalized semi-infinite programming. (With comments and rejoinder). ⋮ A transformation-based discretization method for solving general semi-infinite optimization problems ⋮ On the convergence of a smoothed penalty algorithm for semi-infinite programming ⋮ An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence ⋮ Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints ⋮ Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems ⋮ A modified exchange algorithm for distributional robust optimization and applications in risk management ⋮ Semi-Infinite Programming using High-Degree Polynomial Interpolants and Semidefinite Programming ⋮ 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 ⋮ Copositive tensor optimization problem and its applications to hypergraphs ⋮ Nonlinear robust optimization via sequential convex bilevel programming ⋮ Copositive programming via semi-infinite optimization ⋮ An augmented Lagrangian algorithm for solving semiinfinite programming ⋮ 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 ⋮ Generalized semi-infinite programming: a tutorial ⋮ A semi-infinite programming algorithm for solving optimal power flow with transient stability constraints ⋮ Solving semi-infinite programs by smoothing projected gradient method ⋮ Lipschitz modulus of linear and convex inequality systems with the Hausdorff metric ⋮ An improved bootstrap test for restricted stochastic dominance ⋮ A noninterior point homotopy method for semi-infinite programming problems ⋮ Multiobjective optimization under uncertainty: a multiobjective robust (relative) regret approach ⋮ 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 ⋮ Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems ⋮ New approach for the nonlinear programming with transient stability constraints arising from power systems ⋮ A new smoothing Newton-type algorithm for semi-infinite programming ⋮ 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 ⋮ A standard branch-and-bound approach for nonlinear semi-infinite problems ⋮ A smoothing projected Newton-type algorithm for semi-infinite programming ⋮ An exchange method with refined subproblems for convex semi-infinite programming problems ⋮ A filter trust region method for solving semi-infinite programming problems ⋮ An inexact primal-dual algorithm for semi-infinite programming ⋮ Near-optimal solutions of convex semi-infinite programs via targeted sampling ⋮ 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 ⋮ On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle ⋮ A smoothing Levenberg-Marquardt algorithm for semi-infinite programming
Uses Software
This page was built for publication: Discretization in semi-infinite programming: the rate of convergence
