The models of bilevel programming with lower level second-order cone programs

DOI10.1186/1029-242X-2014-168zbMath1372.90103WikidataQ59323975 ScholiaQ59323975MaRDI QIDQ2405621

Xiaoni Chi, Zijun Hao, Zhong-Ping Wan

Publication date: 26 September 2017

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

zbMATH Keywords

optimality conditionsnonconvexfeasible setnondifferentiablebilevel programming with lower level second-order cone program

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (4)

Some P-properties of the quadratic representations and automorphism invariance in Euclidean Jordan algebras ⋮ MPEC Methods for Bilevel Optimization Problems ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ Second order sufficient conditions for a class of bilevel programs with lower level second-order cone programming problem

Cites Work

• Unnamed Item
• A smoothing and regularization predictor-corrector method for nonlinear inequalities
• First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints
• Is bilevel programming a special case of a mathematical program with complementarity constraints?
• Generalized stationary points and an interior-point method for mathematical programs with equilibrium constraints.
• Some P-properties for linear transformations on Euclidean Jordan algebras
• A new one-step smoothing Newton method for second-order cone programming.
• A new class of smoothing complementarity functions over symmetric cones
• Convergence properties of a smoothing approach for mathematical programs with second-order cone complementarity constraints
• Convergence analysis of the augmented Lagrangian method for nonlinear second-order cone optimization problems
• On the coderivative of the projection operator onto the second-order cone
• Second-order cone programming
• Foundations of bilevel programming
• A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
• A smoothing Newton method for mathematical programs governed by second-order cone constrained generalized equations
• Smoothing method for mathematical programs with symmetric cone complementarity constraints
• A new one-step smoothing newton method for the second-order cone complementarity problem
• Variational Analysis

This page was built for publication: The models of bilevel programming with lower level second-order cone programs