A class of objective filled penalty functions for minimax global optimization problem

DOI10.1186/S13660-025-03391-7MaRDI QIDQ7236577zbMATH OpenFDO

Authors Jiahui Tang, Yifan Xu, Wei Wang

Publication date 29 April 2026

Published in Journal of Inequalities and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1186/S13660-025-03391-7

zbMATH Keywords

local and global optimal solutionsminimax constrained optimization problemobjective filled penalty function

Mathematics Subject Classification ID

Numerical methods based on nonlinear programming (49M37) Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Minimax problems in mathematical programming (90C47)

Cites work

• A filled penalty function method for solving constrained optimization problems
• A new algorithm for solving constrained optimization on exact penalty with two parameters
• A new objective penalty function approach for solving constrained minimax problems
• A nonlinear conjugate gradient algorithm with an optimal property and an improved Wolfe line search
• A nonlinear Lagrangian approach to constrained optimization problems
• A penalty function algorithm with objective parameters for nonlinear mathematical programming
• A simple smooth exact penalty function for smooth optimization problem
• A smoothing objective penalty function algorithm for inequality constrained optimization problems
• A smoothing-out technique for min—max optimization
• An Accelerated Inexact Proximal Point Method for Solving Nonconvex-Concave Min-Max Problems
• An approach to solve local and global optimization problems based on exact objective filled penalty functions
• An objective penalty function method for nonlinear programming.
• Exactness and algorithm of an objective penalty function
• Extended Lagrange And Penalty Functions in Continuous Optimization^*
• Lower-order smoothed objective penalty functions based on filling properties for constrained optimization problems
• New algorithms for constrained minimax optimization
• New exact penalty function for solving constrained finite min-max problems
• On the smoothing of the square-root exact penalty function for inequality constrained optimization
• Smoothing Nonlinear Penalty Functions for Constrained Optimization Problems
• The cyclic Barzilai-–Borwein method for unconstrained optimization
• Unification of filled function and tunnelling function in global optimization
• Value-estimation function method for constrained global optimization

This page was built for publication: A class of objective filled penalty functions for minimax global optimization problem

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