A new approach for nonconvex SIP

zbMATH Open1259.65093MaRDI QIDQ4904783FDOQ4904783

Authors: Mohand Ouanes 

Publication date: 31 January 2013

Full work available at URL: http://www.ijpam.eu/contents/2012-81-3/8/index.html

Recommendations

• A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming
• An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems
• Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems
• Global optimization of semi-infinite programs via restriction of the right-hand side
• Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems

zbMATH Keywords

global optimizationnonlinear programmingsemi-infinite optimizationupper bound functionw-subdivision

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Semi-infinite programming (90C34)

Cited In (4)

• A combined descent gradient method and discretization method for convex SIP
• On saddle points in nonconvex semi-infinite programming
• Near-optimal solutions of convex semi-infinite programs via targeted sampling
• An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems

This page was built for publication: A new approach for nonconvex SIP

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4904783)