An Unconstrained Convex Programming Approach to Linear Semi-Infinite Programming
From MaRDI portal
Publication:4389200
DOI10.1137/S105262349427621XzbMath0912.90275OpenAlexW2029766035MaRDI QIDQ4389200
Soon-Yi Wu, Chih-Jen Lin, Shu-Cherng Fang
Publication date: 12 May 1998
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s105262349427621x
Related Items (5)
Computation algorithm for convex semi-infinite program with second-order cones: special analyses for affine and quadratic case ⋮ Solving convex programming problems with equality constaints by neural networks ⋮ Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method ⋮ ISMISIP: an inexact stochastic mixed integer linear semi-infinite programming approach for solid waste management and planning under uncertainty ⋮ Linear semi-infinite programming theory: an updated survey
Uses Software
This page was built for publication: An Unconstrained Convex Programming Approach to Linear Semi-Infinite Programming
