Smoothing approximation to the lower order exact penalty function for inequality constrained optimization
type: Item
instance of: scholarly article
title: Smoothing approximation to the lower order exact penalty function for inequality constrained optimization
zbMATH Open document ID: 1497.90196
author: Shu-Jun Lian
author: Nana Niu
published in: Journal of Inequalities and Applications
publication date: 2021-12-15T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 15A06
zbMATH DE Number: 7445847
zbMATH Keywords: lower order penalty function
zbMATH Keywords: inequality constrained optimization
zbMATH Keywords: exact penalty function
zbMATH Keywords: smoothing method
MaRDI profile type: Publication
full work available at URL: s13660-018-1723-x
OpenAlex ID: W2808280572
Wikidata QID: Q55423588
cites work: A superlinearly convergent projection method for constrained systems of nonlinear equations
cites work: Z-eigenvalue methods for a global polynomial optimization problem
cites work: Computing power system parameters to maximize the small signal stability margin based on min-max models
cites work: A family of higher-order convergent iterative methods for computing the Moore-Penrose inverse
cites work: Feasibility-solvability theorems for generalized vector equilibrium problem in reflexive Banach spaces
cites work: Generalized Levitin-Polyak Well-Posedness for Generalized Semi-Infinite Programs
cites work: Q5402630
cites work: Convergence analysis of a block improvement method for polynomial optimization over unit spheres
cites work: Parameter selection for nonnegative $l_1$ matrix/tensor sparse decomposition
cites work: Generalized Peaceman-Rachford splitting method for multiple-block separable convex programming with applications to robust PCA
cites work: Proximal ADMM with larger step size for two-block separable convex programming and its application to the correlation matrices calibrating problems
cites work: The Method of Pairwise Variations with Tolerances for Linearly Constrained Optimization Problems
cites work: Q4604758
cites work: Q5072177
cites work: Non-Linear Programming Via Penalty Functions
cites work: Quadratic smoothing approximation to \(l_{1}\) exact penalty function in global optimazation
cites work: Smoothing approximation to \(l_1\) exact penalty function for inequality constrained optimization
cites work: A simple smooth exact penalty function for smooth optimization problem
cites work: An exact lower order penalty function and its smoothing in nonlinear programming
cites work: On the smoothing of the square-root exact penalty function for inequality constrained optimization
cites work: Smoothing approximation to the square-order exact penalty functions for constrained optimization
cites work: A globally convergent algorithm for exact penalty functions
cites work: Smoothing of the lower-order exact penalty function for inequality constrained optimization
cites work: A collection of test problems for constrained global optimization algorithms
DOI: 10.1186/S13660-018-1723-X
description: scientific article; zbMATH DE number 7445847