On the calculation of a feasible point of a nonconvex set: pathfollowing with jumps

DOI10.1080/02331930600819944zbMath1176.90587OpenAlexW2047496999MaRDI QIDQ5758209

Jürgen Guddat, Francisco Guerra, Jan-Joachim Rückmann, Dieter Nowack

Publication date: 3 September 2007

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930600819944

zbMATH Keywords

global optimizationjumpsmultiobjective optimizationgeneralized critical pointParametric optimizationpathfollowingJongen-Jonker-Twilt regularitysingulariy

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Theoretical approach for the calculation of a feasible point of the special non-convex set described by a polyhedron and a quadratic function

Uses Software

• PITCON
• pafo

Cites Work

• Implementation of a continuation method for normal maps
• Nonlinear optimization in finite dimensions. Morse theory, Chebyshev approximation, transversality, flows, parametric aspects
• A modified standard embedding with jumps in nonlinear optimization
• A Homotopy-Based Algorithm for Mixed Complementarity Problems
• A Probability-One Homotopy Algorithm for Nonsmooth Equations and Mixed Complementarity Problems
• Critical sets in parametric optimization
• Solving the Nonlinear Complementarity Problem by a Homotopy Method
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item