Pages that link to "Item:Q742311"

The following pages link to A smoothing augmented Lagrangian method for solving simple bilevel programs (Q742311):

Displayed 20 items.

• Solving ill-posed bilevel programs (Q330322) ‎ (← links)
• Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems (Q496609) ‎ (← links)
• On bilevel programs with a convex lower-level problem violating Slater's constraint qualification (Q1626528) ‎ (← links)
• A modified homotopy method for solving the principal-agent bilevel programming problem (Q1655396) ‎ (← links)
• A bridge between bilevel programs and Nash games (Q1673905) ‎ (← links)
• Approaches to four types of bilevel programming problems with nonconvex nonsmooth lower level programs and their applications to newsvendor problems (Q1683936) ‎ (← links)
• A novel approach based on preference-based index for interval bilevel linear programming problem (Q1689673) ‎ (← links)
• Event-driven optimal control for a robotic exploration, pick-up and delivery problem (Q1730345) ‎ (← links)
• Decomposition algorithms for some deterministic and two-stage stochastic single-leader multi-follower games (Q2028466) ‎ (← links)
• Gauss-Newton-type methods for bilevel optimization (Q2028474) ‎ (← links)
• Theoretical and numerical comparison of the Karush-Kuhn-Tucker and value function reformulations in bilevel optimization (Q2028500) ‎ (← links)
• Inner regularizations and viscosity solutions for pessimistic bilevel optimization problems (Q2401514) ‎ (← links)
• Global Search for Bilevel Optimization with Quadratic Data (Q5014633) ‎ (← links)
• Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) ‎ (← links)
• Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments (Q5058394) ‎ (← links)
• Combining approximation and exact penalty in hierarchical programming (Q5093688) ‎ (← links)
• A Lagrange Multiplier Expression Method for Bilevel Polynomial Optimization (Q5158762) ‎ (← links)
• Bilevel Polynomial Programs and Semidefinite Relaxation Methods (Q5348472) ‎ (← links)
• Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs (Q5501232) ‎ (← links)
• Levenberg-Marquardt method and partial exact penalty parameter selection in bilevel optimization (Q6173804) ‎ (← links)