Nonlinear robust optimization via sequential convex bilevel programming
From MaRDI portal
Publication:2434994
DOI10.1007/s10107-012-0591-2zbMath1282.90240OpenAlexW2070773583MaRDI QIDQ2434994
Publication date: 3 February 2014
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-012-0591-2
robust optimizationsequential convex programmingbilevel optimizationmathematical programming with complementarity constraintssemi-infinite optimization
Minimax problems in mathematical programming (90C47) Semi-infinite programming (90C34) Methods of successive quadratic programming type (90C55)
Related Items (11)
Towards rigorous robust optimal control via generalized high-order moment expansion ⋮ Robust optimization for non-linear impact of data variation ⋮ Adaptive Bundle Methods for Nonlinear Robust Optimization ⋮ An Approximation Scheme for Distributionally Robust Nonlinear Optimization ⋮ Model Order Reduction Techniques with a Posteriori Error Control for Nonlinear Robust Optimization Governed by Partial Differential Equations ⋮ A certified model reduction approach for robust parameter optimization with PDE constraints ⋮ A standard branch-and-bound approach for nonlinear semi-infinite problems ⋮ Decentralized optimization over tree graphs ⋮ A Cutting Plane Approach for Solving Linear Bilevel Programming Problems ⋮ An approach for robust PDE-constrained optimization with application to shape optimization of electrical engines and of dynamic elastic structures under uncertainty ⋮ ROmodel: modeling robust optimization problems in pyomo
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints
- Interior-point algorithms, penalty methods and equilibrium problems
- A quadratically convergent algorithm for solving infinite dimensional inequalities
- A recursive quadratic programming algorithm for semi-infinite optimization problems
- A globally convergent method for nonlinear programming
- Generalized semi-infinite optimization: A first order optimality condition and examples
- First-order algorithms for generalized semi-infinite min-max problems
- A smoothing method for mathematical programs with equilibrium constraints
- Practical bilevel optimization. Algorithms and applications
- Robust solutions of uncertain linear programs
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
- On optimality conditions for generalized semi-infinite programming problems
- Global solution of semi-infinite programs
- A global optimization algorithm using Lagrangian underestimates and the interval Newton method
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- Superlinearly convergent algorithm for min-max problems
- Extending scope of robust optimization: comprehensive robust counterparts of uncertain problems
- An approximation technique for robust nonlinear optimization
- Second-Order Algorithms for Generalized Finite and Semi-Infinite Min-Max Problems
- Generalized semi-infinite programming: numerical aspects
- Robust Convex Optimization
- Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
- ACADO toolkit-An open-source framework for automatic control and dynamic optimization
- Convergence Properties of Algorithms for Nonlinear Optimization
- Semi-Infinite Programming: Theory, Methods, and Applications
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- Strongly Regular Generalized Equations
- The watchdog technique for forcing convergence in algorithms for constrained optimization
- Nonlinear programming via an exact penalty function: Asymptotic analysis
- First Order Conditions for General Nonlinear Optimization
- Robust Truss Topology Design via Semidefinite Programming
- Robust Solutions to Least-Squares Problems with Uncertain Data
- Solving Semi-Infinite Optimization Problems with Interior Point Techniques
- Trust Region Methods
- Modifying SQP for Degenerate Problems
- Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems
- Dynamic compensation method for multivariable control systems with saturating actuators
- Second order optimality conditions for generalized semi-infinite programming problems
- Complete search in continuous global optimization and constraint satisfaction
- Global Convergence of an Elastic Mode Approach for a Class of Mathematical Programs with Complementarity Constraints
- Loss of Superlinear Convergence for an SQP-Type Method with Conic Constraints
- Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
- A new extreme point algorithm and its application in PSQP algorithms for solving mathematical programs with linear complementarity constraints.
- On linear and linearized generalized semi-infinite optimization problems
- Discretization in semi-infinite programming: the rate of convergence
This page was built for publication: Nonlinear robust optimization via sequential convex bilevel programming
