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
- 26Citations
- 10Captures
Metric Options: CountsSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
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.
Bibliographic Details
http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=84870455189&origin=inward; http://dx.doi.org/10.1007/s10107-012-0556-5; http://link.springer.com/10.1007/s10107-012-0556-5; http://link.springer.com/content/pdf/10.1007/s10107-012-0556-5; http://link.springer.com/content/pdf/10.1007/s10107-012-0556-5.pdf; http://link.springer.com/article/10.1007/s10107-012-0556-5/fulltext.html; http://www.springerlink.com/index/10.1007/s10107-012-0556-5; http://www.springerlink.com/index/pdf/10.1007/s10107-012-0556-5; https://dx.doi.org/10.1007/s10107-012-0556-5; https://link.springer.com/article/10.1007/s10107-012-0556-5
Springer Science and Business Media LLC
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know