Second order sufficient conditions for a class of bilevel programs with lower level second-order cone programming problem
From MaRDI portal
Publication:2351272
Recommendations
- The models of bilevel programming with lower level second-order cone programs
- Sufficient optimality conditions in bilevel programming
- Constraint qualifications and optimality conditions in bilevel optimization
- Optimality conditions for bilevel programming problems
- Second order optimality conditions for bilevel set optimization problems
Cites work
- A smoothing Newton method for mathematical programs governed by second-order cone constrained generalized equations
- A smoothing SQP method for mathematical programs with linear second-order cone complementarity constraints
- Applications of second-order cone programming
- Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems
- Computation of error bounds for P-matrix linear complementarity problems
- Convergence analysis of the augmented Lagrangian method for nonlinear second-order cone optimization problems
- Convergence properties of a smoothing approach for mathematical programs with second-order cone complementarity constraints
- First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints
- Foundations of bilevel programming
- Global and global linear convergence of smoothing algorithm for the Cartesian \(P_*(\kappa)\)-SCLCP
- Global optimization algorithm for solving bilevel programming problems with quadratic lower levels
- scientific article; zbMATH DE number 3752608 (Why is no real title available?)
- scientific article; zbMATH DE number 715155 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- scientific article; zbMATH DE number 1766748 (Why is no real title available?)
- Interior point methods for second-order cone programming and OR applications
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- Nonlinear optimization: Characterization of structural stability
- On the coderivative of the projection operator onto the second-order cone
- Robust optimization
- Second-order cone programming
- Smoothing method for mathematical programs with symmetric cone complementarity constraints
- Smoothing Newton algorithm based on a regularized one-parametric class of smoothing functions for generalized complementarity problems over symmetric cones
- Some P-properties for linear transformations on Euclidean Jordan algebras
- The models of bilevel programming with lower level second-order cone programs
- Variational Analysis
Cited in
(7)- Global convergence of algorithms under constant rank conditions for nonlinear second-order cone programming
- Penalty method-based equilibrium point approach for solving the linear bilevel multiobjective programming problem
- Necessary optimality condition for trilevel optimization problem
- Some P-properties of the quadratic representations and automorphism invariance in Euclidean Jordan algebras
- The models of bilevel programming with lower level second-order cone programs
- MPEC methods for bilevel optimization problems
- Bilevel optimization: theory, algorithms, applications and a bibliography
This page was built for publication: Second order sufficient conditions for a class of bilevel programs with lower level second-order cone programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2351272)
