Discretization methods for the solution of semi-infinite programming problems

DOI10.1007/BF00940041zbMath0793.90088OpenAlexW2032807064MaRDI QIDQ1321097

Rembert Reemtsen

Publication date: 16 August 1994

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00940041

zbMATH Keywords

convergencediscretization methodsnonlinear semi-infinite programmingmultivariate Chebyshev approximation

Mathematics Subject Classification ID

Nonlinear programming (90C30) Best approximation, Chebyshev systems (41A50) Semi-infinite programming (90C34) Multidimensional problems (41A63)

Related Items (36)

Convergent Algorithms for a Class of Convex Semi-infinite Programs ⋮ Some outer approximation methods for semi-infinite optimization problems ⋮ A penalty function method for the principal-agent problem with an infinite number of incentive-compatibility constraints under moral hazard ⋮ A nonsmooth Levenberg-Marquardt method for solving semi-infinite programming problems ⋮ Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables ⋮ Scenario approximation of robust and chance-constrained programs ⋮ A transformation-based discretization method for solving general semi-infinite optimization problems ⋮ A ladder method for linear 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 ⋮ Global convergence of a class of smooth penalty methods for semi-infinite programming ⋮ A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems ⋮ Robot trajectory planning with semi-infinite programming. ⋮ On the numerical treatment of linearly constrained semi-infinite optimization problems ⋮ A sequential quadratic programming with a dual parametrization approach to nonlinear semi-infinite programming ⋮ A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming ⋮ Necessary conditions and duality for inexact nonlinear semi-infinite programming problems ⋮ An interior point sequential quadratic programming-type method for log-determinant semi-infinite programs ⋮ A quasi-Newton interior point method for semi-infinite programming ⋮ A cutting plane method for solving minimax problems in the complex plane ⋮ Air pollution control with semi-infinite programming ⋮ Proximal interior point method for convex semi-infinite programming ⋮ On the continuity of the optimal value in parametric linear optimization: Stable discretization of the Lagrangian dual of nonlinear problems ⋮ A dynamic game approach to distributionally robust safety specifications for stochastic systems ⋮ Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints ⋮ Numerical experiments in semi-infinite programming ⋮ An exchange method with refined subproblems for convex semi-infinite programming problems ⋮ An Efficient Algorithm for Min-Max Convex Semi-Infinite Programming Problems ⋮ A new adaptive method to nonlinear semi-infinite programming ⋮ Convex semi-infinite parametric programming: Uniform convergence of the optimal value functions of discretized problems ⋮ An inexact primal-dual algorithm for semi-infinite programming ⋮ Cutting plane algorithms for robust conic convex optimization problems ⋮ Approximation in normed linear spaces ⋮ 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 ⋮ Problem-based optimal scenario generation and reduction in stochastic programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A numerically stable dual method for solving strictly convex quadratic programs
• A note on the regularization of discrete approximation problems
• Semi-infinite programming and applications. An International Symposium, Austin, Texas, September 8-10, 1981
• Modifications of the First Remez Algorithm
• An implementation of a discretization method for semi-infinite programming
• A cutting-plane method for quadratic semi infinite programming problems
• A Multiple Exchange Algorithm for Multivariate Chebyshev Approximation
• Necessary Conditions for a Minimax Approximation

This page was built for publication: Discretization methods for the solution of semi-infinite programming problems