On the merit and penalty functions for the d.c. optimization

DOI10.1007/978-3-319-44914-2_36MaRDI QIDQ3133235zbMATH OpenOpenAlexFDO

Authors A. S. Strekalovskiĭ

Publication date 13 February 2018

Published in Discrete Optimization and Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-44914-2_36

zbMATH Keywords

nonlinear programmingglobal optimality conditionsd.c. functionsLagrange functionpenalty functions

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Recommendations

• On a global search in D.C. optimization problems
• Global optimality conditions in nonconvex optimization
• Global optimality conditions and exact penalization
• scientific article; zbMATH DE number 2084880
• Global and local search methods for D.C. constrained problems

Cited in

(1)

• Some new Farkas-type results for inequality systems with DC functions

This page was built for publication: On the merit and penalty functions for the d.c. optimization

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