Nonlinear robust optimization via sequential convex bilevel programming

In this paper, we present a novel sequential convex bilevel programming algorithm for the numerical solution of structured nonlinear min–max problems which arise in the context of semi-infinite programming. Here, our main motivation are nonlinear inequality constrained robust optimization problems....

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Mathematical programming Ročník 142; číslo 1-2; s. 539 - 577
Hlavní autoři:	Houska, Boris, Diehl, Moritz
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin/Heidelberg Springer Berlin Heidelberg 01.12.2013 Springer Nature B.V
Témata:	Algorithms Analysis Approximation Calculus of Variations and Optimal Control; Optimization Combinatorics Convex analysis Full Length Paper Linear programming Mathematical and Computational Physics Mathematical Methods in Physics Mathematical programming Mathematics Mathematics and Statistics Mathematics of Computing Numerical Analysis Optimization Studies Theoretical Mathematical programming with complementarity constraints Bilevel optimization Robust optimization Semi-infinite optimization 90C47 90C55 90C34 Sequential convex programming
ISSN:	0025-5610, 1436-4646
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!