4.6 Article

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

Related references

Note: Only part of the references are listed.
Article Mathematics, Applied

Local convergence of SQP methods for mathematical programs with equilibrium constraints

R Fletcher et al.

SIAM JOURNAL ON OPTIMIZATION (2006)

Article Computer Science, Software Engineering

Global solution of semi-infinite programs

B Bhattacharjee et al.

MATHEMATICAL PROGRAMMING (2005)

Article Computer Science, Interdisciplinary Applications

Global optimization in the 21st century: Advances and challenges

CA Floudas et al.

COMPUTERS & CHEMICAL ENGINEERING (2005)

Article Operations Research & Management Science

Interval methods for semi-infinite programs

B Bhattacharjee et al.

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS (2005)

Article Operations Research & Management Science

A new class of improved convex underestimators for twice continuously differentiable constrained NLPs

IG Akrotirianakis et al.

JOURNAL OF GLOBAL OPTIMIZATION (2004)

Article Automation & Control Systems

Solving semi-infinite optimization problems with interior point techniques

O Stein et al.

SIAM JOURNAL ON CONTROL AND OPTIMIZATION (2003)

Article Operations Research & Management Science

Set containment characterization

OL Mangasarian

JOURNAL OF GLOBAL OPTIMIZATION (2002)

Article Management

On generalized semi-infinite optimization and bilevel optimization

O Stein et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2002)

Article Operations Research & Management Science

Mathematical programs with complementarity constraints: Stationarity, optimality, and sensitivity

H Scheel et al.

MATHEMATICS OF OPERATIONS RESEARCH (2000)