PlumX Metrics
Embed PlumX Metrics

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

Mathematical Programming, ISSN: 0025-5610, Vol: 136, Issue: 1, Page: 183-207
2012
  • 26
    Citations
  • 0
    Usage
  • 10
    Captures
  • 0
    Mentions
  • 0
    Social Media
Metric Options:   Counts1 Year3 Year

Metrics Details

  • Citations
    26
    • Citation Indexes
      26
  • Captures
    10

Conference Paper Description

A numerical solution method for semi-infinite optimization problems with arbitrary, not necessarily box-shaped, index sets is presented. Following the ideas of Floudas and Stein (SIAM J Optim 18:1187-1208, 2007), convex relaxations of the lower level problem are adaptively constructed and then reformulated as mathematical programs with complementarity constraints and solved. Although the index set is arbitrary, this approximation produces feasible iterates for the original problem. The convex relaxations and needed parameters are constructed with ideas of the αBB method of global optimization and interval methods. It is shown that after finitely many steps an ε-stationary point of the original semi-infinite problem is reached. A numerical example illustrates the performance of the proposed method. © 2012 Springer and Mathematical Optimization Society.

Provide Feedback

Have ideas for a new metric? Would you like to see something else here?Let us know