Numerical treatment of a class of semi‐infinite programming problems

DOI10.1002/nav.3800200310zbMath0272.90073OpenAlexW1995769522MaRDI QIDQ5181566

No author found.

Publication date: 1973

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800200310

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

A relaxed cutting plane algorithm for solving fuzzy inequality systems, Some outer approximation methods for semi-infinite optimization problems, Optimal value function in semi-infinite programming, A primal-dual infeasible-interior-point algorithm for linear semi- infinite programming, On Stable Calculation of Linear Functionals, Implementation of an inexact approach to solving linear semi-infinite programming problems, A relaxed cutting plane algorithm for solving the Vasicek-type forward interest rate model, Semi-infinite programming, On approximate solutions of infinite systems of linear inequalities, Recent contributions to linear semi-infinite optimization, On Linear Semi-Infinite Programming Problems: An Algorithm, A discretization method for systems of linear inequalities, Computer program for the discrete linear restricted Chebyshev approximation, A one-phase algorithm for semi-infinite linear programming, Computer-aided design via optimization: A review, A perturbation method for solving linear semi-infinite programming problems, Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method, Relaxed cutting plane method for solving linear semi-infinite programming problems, Recent contributions to linear semi-infinite optimization: an update, Solving semi-infinite programs by smoothing projected gradient method, Convex SIP problems with finitely representable compact index sets: immobile indices and the properties of the auxiliary NLP problem, Extremal points and optimal solutions for general capacity problems, On the computation of reference signal constraints for guaranteed tracking performance, An inexact approach to solving linear semi-infinite programming problems, A semi-infinite programming method for approximating load duration curves by polynomials, Linear Chebyshev approximation without Chebyshev sets, Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization, Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme, Solving fuzzy variational inequalities over a compact set, Infinitely constrained optimization problems, Numerical treatment of a parabolic boundary-value control problem, The discrete linear restricted Chebyshev approximation, Separably-infinite programs, A gradient projection method for solving continuous games, Polyextremal principles and separably-infinite programs, On the resolution of the Vasicek-type interest rate model, An extension of the simplex algorithm for semi-infinite linear programming, Combined entropic regularization and path-following method for solving finite convex min-max problems subject to infinitely many linear constraints, Approximation in normed linear spaces, Linear programming in measure spaces, A smoothing Levenberg-Marquardt algorithm for semi-infinite programming, A dual parameterization approach to linear-quadratic semi-infinite programming problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotic duality over closed convex sets
• Programmes in Paired Spaces
• On the Maximum Errors of Polynomial Approximations Defined by Interpolation and by Least Squares Criteria
• On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions
• Formulation of Linear Programs in Analysis. I: Approximation Theory