Pages that link to "Item:Q1016068"
From MaRDI portal
The following pages link to Global solution of bilevel programs with a nonconvex inner program (Q1016068):
Displaying 50 items.
- On the solution of convex bilevel optimization problems (Q263155) (← links)
- Solving quality control problems with an algorithm for minimax programs with coupled constraints (Q336795) (← links)
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development (Q480823) (← links)
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results (Q480824) (← links)
- Global optimization of generalized semi-infinite programs via restriction of the right hand side (Q486720) (← links)
- Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems (Q496609) (← links)
- A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs (Q670656) (← links)
- A smoothing augmented Lagrangian method for solving simple bilevel programs (Q742311) (← links)
- A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems (Q839044) (← links)
- A review of recent advances in global optimization (Q842710) (← links)
- Towards global bilevel dynamic optimization (Q842715) (← links)
- Multilevel decision-making: a survey (Q1615283) (← links)
- On bilevel programs with a convex lower-level problem violating Slater's constraint qualification (Q1626528) (← links)
- Bilevel programming for generating discrete representations in multiobjective optimization (Q1646577) (← links)
- Optimal deterministic algorithm generation (Q1668803) (← links)
- A bridge between bilevel programs and Nash games (Q1673905) (← links)
- A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs (Q1675550) (← links)
- On unbounded and binary parameters in multi-parametric programming: applications to mixed-integer bilevel optimization and duality theory (Q1683323) (← links)
- A mixed-integer bilevel programming approach for a competitive prioritized set covering problem (Q1751159) (← links)
- A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs (Q1785391) (← links)
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets (Q1925776) (← links)
- A lifting method for generalized semi-infinite programs based on lower level Wolfe duality (Q1938906) (← links)
- Global solution of nonlinear mixed-integer bilevel programs (Q1959230) (← links)
- Gauss-Newton-type methods for bilevel optimization (Q2028474) (← links)
- A deterministic bounding procedure for the global optimization of a bi-level mixed-integer problem (Q2029945) (← links)
- An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities (Q2089867) (← links)
- On convex lower-level black-box constraints in bilevel optimization with an application to gas market models with chance constraints (Q2089868) (← links)
- A robust approach to warped Gaussian process-constrained optimization (Q2097663) (← links)
- On solving bilevel optimization problems with a nonconvex lower level: the case of a bimatrix game (Q2117635) (← links)
- A non-convex non-smooth bi-level parameter learning for impulse and Gaussian noise mixture removing (Q2128875) (← links)
- A non-convex denoising model for impulse and Gaussian noise mixture removing using bi-level parameter identification (Q2158253) (← links)
- SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs (Q2164703) (← links)
- Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables (Q2168050) (← links)
- New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm (Q2176276) (← links)
- Bilevel programming solution algorithms for optimal price-bidding of energy producers in multi-period day-ahead electricity markets with non-convexities (Q2245701) (← links)
- A semi-infinite programming based algorithm for determining T-optimum designs for model discrimination (Q2256741) (← links)
- Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints (Q2274885) (← links)
- How to solve a design centering problem (Q2408900) (← links)
- On solving simple bilevel programs with a nonconvex lower level program (Q2452381) (← links)
- An improved spatially controlled reaction-diffusion equation with a non-linear second order operator for image super-resolution (Q2665485) (← links)
- Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems (Q2796798) (← links)
- Global optimization of semi-infinite programs via restriction of the right-hand side (Q3111137) (← links)
- Decision Rule Bounds for Two-Stage Stochastic Bilevel Programs (Q4603038) (← links)
- A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem (Q4604908) (← links)
- On the computation of relaxed pessimistic solutions to MPECs (Q4924110) (← links)
- Global Search for Bilevel Optimization with Quadratic Data (Q5014633) (← links)
- MPEC Methods for Bilevel Optimization Problems (Q5014634) (← links)
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← links)
- A Lagrange Multiplier Expression Method for Bilevel Polynomial Optimization (Q5158762) (← links)
- Bilevel Polynomial Programs and Semidefinite Relaxation Methods (Q5348472) (← links)
