Nonconvex Structures in Nonlinear Programming

DOI10.1287/opre.1030.0102zbMath1165.90597MaRDI QIDQ3637433

Stefan Scholtes

Publication date: 10 July 2009

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.1030.0102

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

90C30: Nonlinear programming

90C56: Derivative-free methods and methods using generalized derivatives

90C55: Methods of successive quadratic programming type

Related Items

On conic QPCCs, conic QCQPs and completely positive programs, A computational study for bilevel quadratic programs using semidefinite relaxations, Three modeling paradigms in mathematical programming, An aggregate deformation homotopy method for min-max-min problems with max-min constraints, A hybrid approach to the solution of a pricing model with continuous demand segmentation, Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications, First- and second-order optimality conditions for mathematical programs with vanishing constraints., Mathematical programs with vanishing constraints: Optimality conditions, sensitivity, and a relaxation method, Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs, A semidefinite programming heuristic for quadratic programming problems with complementarity constraints, International portfolio choice and political instability risk: a multi-objective approach, Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints