An inexact primal-dual algorithm for semi-infinite programming
From MaRDI portal
Abstract: This paper considers an inexact primal-dual algorithm for semi-infinite programming (SIP) for which it provides general error bounds. To implement the dual variable update, we create a new prox function for nonnegative measures which turns out to be a generalization of the Kullback-Leibler divergence for probability distributions. We show that under suitable conditions on the error, this algorithm achieves an rate of convergence in terms of the optimality gap and constraint violation. We then use our general error bounds to analyze the convergence and sample complexity of a specific primal-dual SIP algorithm based on Monte Carlo integration. Finally, we provide numerical experiments to demonstrate the performance of our algorithm.
Recommendations
- The CoMirror algorithm with random constraint sampling for convex semi-infinite programming
- A primal-dual infeasible-interior-point algorithm for linear semi- infinite programming
- A stochastic variance-reduced accelerated primal-dual method for finite-sum saddle-point problems
- A first-order inexact primal-dual algorithm for a class of convex-concave saddle point problems
Cites work
- scientific article; zbMATH DE number 1186924 (Why is no real title available?)
- scientific article; zbMATH DE number 3659282 (Why is no real title available?)
- scientific article; zbMATH DE number 2061729 (Why is no real title available?)
- scientific article; zbMATH DE number 2117879 (Why is no real title available?)
- scientific article; zbMATH DE number 3202900 (Why is no real title available?)
- A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
- A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization
- A Truncated Projected Newton-Type Algorithm for Large-Scale Semi-infinite Programming
- A cutting-surface method for uncertain linear programs with polyhedral stochastic dominance constraints
- A dual parametrization method for convex semi-infinite programming
- A new exchange method for convex semi-infinite programming
- A new quadratic semi-infinite programming algorithm based on dual parametrization
- A new smoothing Newton-type algorithm for semi-infinite programming
- A smoothing Newton method for semi-infinite programming
- A smoothing projected Newton-type algorithm for semi-infinite programming
- An accelerated central cutting plane algorithm for linear semi-infinite programming
- An adaptive dual parametrization algorithm for quadratic semi-infinite programming problems
- Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
- Discretization in semi-infinite programming: the rate of convergence
- Discretization methods for the solution of semi-infinite programming problems
- Ergodic, primal convergence in dual subgradient schemes for convex programming
- From infinite to finite programs: explicit error bounds with applications to approximate dynamic programming
- Infinite dimensional analysis. A hitchhiker's guide.
- Lagrangian Relaxation via Ballstep Subgradient Methods
- Linear semi-infinite programming theory: an updated survey
- Local Convergence of SQP Methods in Semi-Infinite Programming
- Minimax Theorems
- Modern methods in the calculus of variations. \(L^p\) spaces
- On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
- On the weak convergence of an ergodic iteration for the solution of variational inequalities for monotone operators in Hilbert space
- Optimization with Multivariate Conditional Value-at-Risk Constraints
- Optimization with Stochastic Dominance Constraints
- Optimization with a class of multivariate integral stochastic order constraints
- Optimization with multivariate stochastic dominance constraints
- Optimization with multivariate stochastic dominance constraints
- Optimization with stochastic preferences based on a general class of scalarization functions
- Pattern recognition and machine learning.
- Performance Bounds for the Scenario Approach and an Extension to a Class of Non-Convex Programs
- Primal convergence from dual subgradient methods for convex optimization
- Primal-dual algorithms for optimization with stochastic dominance
- Recent contributions to linear semi-infinite optimization
- Sample average approximation of stochastic dominance constrained programs
- Semi-Infinite Programming: Theory, Methods, and Applications
- Semi-infinite programming
- Semi-infinite programming, duality, discretization and optimality conditions†
- Semismooth Newton methods for solving semi-infinite programming problems
- Subgradient methods for saddle-point problems
- The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
- Two ``well-known properties of subgradient optimization
- Uncertain convex programs: randomized solutions and confidence levels
- Validation analysis of mirror descent stochastic approximation method
Cited in
(9)- The CoMirror algorithm with random constraint sampling for convex semi-infinite programming
- scientific article; zbMATH DE number 1241353 (Why is no real title available?)
- Implementation of an inexact approach to solving linear semi-infinite programming problems
- Primal-dual partitions in linear semi-infinite programming with bounded coefficients
- A primal-dual homotopy algorithm for \(\ell _{1}\)-minimization with \(\ell _{\infty }\)-constraints
- A primal-dual approach to inexact subgradient methods
- Stability of the primal-dual partition in linear semi-infinite programming
- Primal-dual affine-scaling algorithms fail for semidefinite programming
- Near-optimal solutions of convex semi-infinite programs via targeted sampling
This page was built for publication: An inexact primal-dual algorithm for semi-infinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q784788)
