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

DOI10.1080/02331930902884307zbMath1229.90217OpenAlexW1995668600MaRDI QIDQ2786333

Ridelio Miranda

Publication date: 21 September 2010

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

parametric optimizationhomotopy methodgenericityembedding methodfeasibility problemJongen-Jonker-Twilt regularity

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Quadratic programming (90C20) Sensitivity, stability, parametric optimization (90C31)

Related Items (1)

Unnamed Item

Cites Work

• On generic quadratic penalty embeddings for nonlinear optimization problems
• Critical sets in parametric optimization
• On the calculation of a feasible point of a nonconvex set: pathfollowing with jumps
• Unnamed Item
• Unnamed Item

This page was built for publication: Theoretical approach for the calculation of a feasible point of the special non-convex set described by a polyhedron and a quadratic function