☆ 4.5 Article

Global Solution of Semi-infinite Programs with Existence Constraints

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2021)

Related references

Note: Only part of the references are listed.

Article Operations Research & Management Science

A note on semi-infinite program bounding methods

Stuart M. Harwood et al.

Summary: Semi-infinite programs have a finite number of decision variables and infinite constraints, where a sequence of lower bounds can be obtained through finite approximations of the constraint set. A modification of the lower bounding method involving approximate solution of the lower-level program can yield convergent lower bounds, but requires the correct approximate solution of the lower-level program.

OPTIMIZATION LETTERS (2021)

Add to Collection

Article Operations Research & Management Science

A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs

Hatim Djelassi et al.

JOURNAL OF GLOBAL OPTIMIZATION (2017)

Add to Collection

Article Operations Research & Management Science

Global optimization of generalized semi-infinite programs via restriction of the right hand side

Alexander Mitsos et al.

JOURNAL OF GLOBAL OPTIMIZATION (2015)

Add to Collection

Article Management

How to solve a semi-infinite optimization problem

Oliver Stein

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2012)

Add to Collection

Article Computer Science, Software Engineering

The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets

Oliver Stein et al.

MATHEMATICAL PROGRAMMING (2012)

Add to Collection

Article Operations Research & Management Science

Global optimization of semi-infinite programs via restriction of the right-hand side

Alexander Mitsos

OPTIMIZATION (2011)

Add to Collection

Article Operations Research & Management Science

A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming

Angelos Tsoukalas et al.

OPTIMIZATION LETTERS (2011)

Add to Collection

Article Operations Research & Management Science

A smoothing algorithm for finite min-max-min problems

Angelos Tsoukalas et al.

OPTIMIZATION LETTERS (2009)

Add to Collection

Review Mathematics, Applied

Generalized semi-infinite programming:: A tutorial

F. Guerra Vazquez et al.

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS (2008)

Add to Collection

Article Mathematics, Applied

THE ADAPTIVE CONVEXIFICATION ALGORITHM: A FEASIBLE POINT METHOD FOR SEMI-INFINITE PROGRAMMING

Christodoulos A. Floudas et al.

SIAM JOURNAL ON OPTIMIZATION (2008)

Add to Collection

Article Mathematics, Applied

Relaxation-based bounds for semi-infinite programs

Alexander Mitsos et al.

SIAM JOURNAL ON OPTIMIZATION (2008)

Add to Collection

Article Operations Research & Management Science

Adjustable robust optimization models for a nonlinear two-period system

A. Takeda et al.

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2008)

Add to Collection

Article Computer Science, Hardware & Architecture

Robust capacity expansion of network flows

Fernando Ordonez et al.

NETWORKS (2007)

Add to Collection

Review Management

Semi-infinite programming

Marco Lopez et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2007)

Add to Collection

Article Computer Science, Software Engineering

Global solution of semi-infinite programs

B Bhattacharjee et al.

MATHEMATICAL PROGRAMMING (2005)

Add to Collection

Article Operations Research & Management Science

Interval methods for semi-infinite programs

B Bhattacharjee et al.

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS (2005)

Add to Collection

Article Computer Science, Software Engineering

Adjustable robust solutions of uncertain linear programs

A Ben-Tal et al.

MATHEMATICAL PROGRAMMING (2004)

Add to Collection

Article Operations Research & Management Science

Algorithms for finite and semi-infinite min-max-min problems using adaptive smoothing techniques

E Polak et al.

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2003)

Add to Collection

© Peeref 2019-2024. All rights reserved.