On Linear Semi-Infinite Programming Problems: An Algorithm
From MaRDI portal
Recommendations
- A one-phase algorithm for semi-infinite linear programming
- scientific article; zbMATH DE number 776087
- A primal-dual infeasible-interior-point algorithm for linear semi- infinite programming
- scientific article; zbMATH DE number 3870083
- A perturbation method for solving linear semi-infinite programming problems
Cites work
- scientific article; zbMATH DE number 3900550 (Why is no real title available?)
- scientific article; zbMATH DE number 4029251 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3760758 (Why is no real title available?)
- scientific article; zbMATH DE number 3525695 (Why is no real title available?)
- Fuzzy mathematical programming. Methods and applications
- Numerical treatment of a class of semi‐infinite programming problems
- Programmes in Paired Spaces
- The capacity problem
Cited in
(34)- An efficient algorithm for - convex semi-infinite programming problems
- An algorithm for semi-infinite polynomial optimization
- An interior point sequential quadratic programming-type method for log-determinant semi-infinite programs
- Duality theorems and algorithms for linear programming in measure spaces
- scientific article; zbMATH DE number 3870083 (Why is no real title available?)
- A primal-dual infeasible-interior-point algorithm for linear semi- infinite programming
- Understanding linear semi-infinite programming via linear programming over cones
- scientific article; zbMATH DE number 4001882 (Why is no real title available?)
- Generalized corner optimal solution for LSIP: existence and numerical computation
- An efficient algorithm for solving semi-infinite inequality problems with box constraints
- Implementation of an inexact approach to solving linear semi-infinite programming problems
- A ladder method for linear semi-infinite programming
- Separation by hyperplanes: a linear semi-infinite programming approach.
- A perturbation method for solving linear semi-infinite programming problems
- Solving semi-infinite programs by smoothing projected gradient method
- Some applications of the Semi-Infinite Simplex Algorithm
- Applications of Integer Semi-Infinite Programing to the Integer Chebyshev Problem
- Solving strategies and well-posedness in linear semi-infinite programming
- Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme
- A new smoothing Newton-type algorithm for semi-infinite programming
- Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints
- Probability maximization models for portfolio selection under ambiguity
- Linear programming in measure spaces
- Linear semi-infinite programming theory: an updated survey
- An exchange method with refined subproblems for convex 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
- A smoothing Levenberg-Marquardt algorithm for semi-infinite programming
- Computation algorithm for convex semi-infinite program with second-order cones: special analyses for affine and quadratic case
- scientific article; zbMATH DE number 1383149 (Why is no real title available?)
- Solving linear programs with finite precision. II: Algorithms
- An algorithm for calculating -minimax decision rules under generalized moment conditions.
- Simplex-type algorithm for second-order cone programmes via semi-infinite programming reformulation
- A comparative study of several semi-infinite nonlinear programming algorithms
This page was built for publication: On Linear Semi-Infinite Programming Problems: An Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4029144)
