Journal ArticleDOI
Semi-Infinite Programming
Marco A. López,Georg Still +1 more
TLDR
Semi-infinite programming (SIP) as discussed by the authors is an optimization problem in which finitely many variables appear in infinitely many constraints, and it naturally arises in an abundant number of applications in different fields of mathematics, economics and engineering.About:
This article is published in European Journal of Operational Research.The article was published on 2001-01-01. It has received 213 citations till now. The article focuses on the topics: Semi-infinite programming & Optimization problem.read more
Citations
More filters
Journal ArticleDOI
Robust Transmission in Downlink Multiuser MISO Systems: A Rate-Splitting Approach
Hamdi Joudeh,Bruno Clerckx +1 more
TL;DR: It is proved that a RS-based design achieves higher max-min (symmetric) degrees of freedom (DoF) compared with conventional designs (NoRS) and extended to address the quality of service (QoS) constrained power minimization problem, and significant gains over NoRS-based designs are demonstrated.
Book ChapterDOI
Algorithm engineering in robust optimization
Marc Goerigk,Anita Schöbel +1 more
TL;DR: This paper argues that the algorithm engineering methodology fits very well to the field of robust optimization and yields a rewarding new perspective on both the current state of research and open research directions.
Journal ArticleDOI
Semi-infinite programming, duality, discretization and optimality conditions†
TL;DR: A survey of semi-infinite programming can be found in this paper, where various approaches to derivations of duality, discretization, and first-and second-order optimality conditions are discussed.
Journal ArticleDOI
Harmonic grammar with linear programming: From linear systems to linguistic typology
TL;DR: A Harmonic Grammar analysis of ATR harmony in Lango is developed that is, it is argued, superior to the existing OT and rule-based treatments and highlights the usefulness of OT-Help, and the analytic power of Harmonics Grammar.
Journal ArticleDOI
How to solve a semi-infinite optimization problem
TL;DR: This article surveys recent developments in theory and numerical methods for standard and generalized semi-infinite optimization problems, paying particular attention to connections with mathematical programs with complementarity constraints, lower level Wolfe duality, semi-smooth approaches, as well as branch and bound techniques in adaptive convexification procedures.
References
More filters
Book
Interior-Point Polynomial Algorithms in Convex Programming
TL;DR: This book describes the first unified theory of polynomial-time interior-point methods, and describes several of the new algorithms described, e.g., the projective method, which have been implemented, tested on "real world" problems, and found to be extremely efficient in practice.
Book
Perturbation Analysis of Optimization Problems
TL;DR: It is shown here how the model derived recently in [Bouchut-Boyaval, M3AS (23) 2013] can be modified for flows on rugous topographies varying around an inclined plane.
Book
Mathematical Programs with Equilibrium Constraints
TL;DR: Results in the book are expected to have significant impacts in such disciplines as engineering design, economics and game equilibria, and transportation planning, within all of which MPEC has a central role to play in the modelling of many practical problems.
Journal ArticleDOI
Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
TL;DR: This note formulates a convex mathematical programming problem in which the usual definition of the feasible region is replaced by a significantly different strategy via set containment.
Journal ArticleDOI
Robust solutions of uncertain linear programs
Aharon Ben-Tal,Arkadi Nemirovski +1 more
TL;DR: It is shown that the RC of an LP with ellipsoidal uncertainty set is computationally tractable, since it leads to a conic quadratic program, which can be solved in polynomial time.