An objective penalty function-based method for inequality constrained minimization problem
type: Item
instance of: scholarly article
title: An objective penalty function-based method for inequality constrained minimization problem
zbMATH Open document ID: 1427.90266
DOI: 10.1155/2018/7484256
author: Shu-Jun Lian
author: Sitong Meng
author: Yiju Wang
published in: Mathematical Problems in Engineering
publication date: 2019-02-08T00:00:00Z
review text: Summary: For inequality constrained minimization problem, we first propose a new exact nonsmooth objective penalty function and then apply a smooth technique to the penalty function to make it smooth. It is shown that any minimizer of the smoothing objective penalty function is an approximated solution of the original problem. Based on this, we develop a solution method for the inequality constrained minimization problem and prove its global convergence. Numerical experiments are provided to show the efficiency of the proposed method.
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C56
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 7019452
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2018/7484256
OpenAlex ID: W2805250513
cites work: Generalized Peaceman-Rachford splitting method for multiple-block separable convex programming with applications to robust PCA
cites work: Convergence analysis of a block improvement method for polynomial optimization over unit spheres
cites work: An \(H\)-tensor based iterative scheme for identifying the positive definiteness of multivariate homogeneous forms
cites work: Criteria for strong \(H\)-tensors
cites work: Column sufficient tensors and tensor complementarity problems
cites work: \(Z\)-eigenvalue inclusion theorems for tensors
cites work: Existence-stability theorems for strong vector set-valued equilibrium problems in reflexive Banach spaces
cites work: Generalized Levitin-Polyak Well-Posedness for Generalized Semi-Infinite Programs
cites work: Gradient-free method for nonsmooth distributed optimization
cites work: Generalized strict feasibility and solvability for generalized vector equilibrium problem with set-valued map in reflexive Banach spaces
cites work: A smoothing inexact Newton method for \(P_0\) nonlinear complementarity problem
cites work: A new \(CQ\) method for solving split feasibility problem
cites work: A practical method for computing the largestM-eigenvalue of a fourth-order partially symmetric tensor
cites work: A family of conjugate gradient methods for large-scale nonlinear equations
cites work: Numerical Optimization
cites work: Non-Linear Programming Via Penalty Functions
cites work: Exact penalty functions in nonlinear programming
cites work: Exact penalty functions and stability in locally Lipschitz programming
cites work: Exact Penalty Functions in Constrained Optimization
cites work: A simple smooth exact penalty function for smooth optimization problem
cites work: Smoothing approximation to \(l_1\) exact penalty function for inequality constrained optimization
cites work: A second-order smooth penalty function algorithm for constrained optimization problems
cites work: Quadratic smoothing approximation to \(l_{1}\) exact penalty function in global optimazation
cites work: An exact lower order penalty function and its smoothing in nonlinear programming
cites work: Smoothing approximation to the square-order exact penalty functions for constrained optimization
cites work: Smoothing of the lower-order exact penalty function for inequality constrained optimization
cites work: Optimization by Least Squares
cites work: Q3330984
cites work: An objective penalty function method for nonlinear programming.
cites work: A new objective penalty function approach for solving constrained minimax problems
cites work: Exactness and algorithm of an objective penalty function
description: scientific article; zbMATH DE number 7019452