Operations Research Transactions ›› 2025, Vol. 29 ›› Issue (4): 61-71.doi: 10.15960/j.cnki.issn.1007-6093.2025.04.005

• Research Article • Previous Articles     Next Articles

An exact penalty approach to a cone constrained optimization problem

Qianqian CHI1,2, Yuying ZHOU1,*()   

  1. 1. School of Mathematical Sciences, Soochow University, Suzhou 215006, Jiangsu, China
    2. Laiwu Experimental School of Jinan, Jinan 250022, Shandong, China
  • Received:2022-09-03 Online:2025-12-15 Published:2025-12-11
  • Contact: Yuying ZHOU E-mail:yuyingz@suda.edu.cn

Abstract:

A penalty approach method has been used to deal with a cone constrained minimization problem on complete metric spaces in this paper. By exploring Ekeland's variational principle, the property of $\mu$-function and some new technique, approximate solutions of the unconstrained penalized problem for some penalty parameter have been established, and then approximate solutions of the cone constrained optimization have been obtained without assuming that the constrained function is convex and the objective function satisfies the coercive condition.

Key words: cone constrained optimization, penalty function, μ function, approximate solutions

CLC Number: