On solving three classes of nonlinear programming problems via simple differentiable penalty functions
type: Item
instance of: scholarly article
title: On solving three classes of nonlinear programming problems via simple differentiable penalty functions
zbMATH Open document ID: 0616.90061
DOI: 10.1007/BF00938528
author: Yanyan Li
published in: Journal of Optimization Theory and Applications
publication date: 1988-01-01T00:00:00Z
review text: We consider the following classes of nonlinear programming problems: the minimization of smooth functions subject to general constraints and simple bounds on the variables; the nonlinear \(\ell _ 1\)-problem; and the minimax problem. Numerically reliable methods for solving problems in each of these classes, based upon exploiting the structure of the problem in constructing simple differentiable penalty functions, are presented.
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 49M37
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 3999671
zbMATH Keywords: smooth functions
zbMATH Keywords: simple bounds on the variables
zbMATH Keywords: nonlinear \(\ell _ 1\)- problem
zbMATH Keywords: minimax problem
zbMATH Keywords: quadratic penalty functions
MaRDI profile type: Publication
cites work: On the Accurate Determination of Search Directions for Simple Differentiable Penalty Functions
cites work: Q5588268
cites work: Q5648155
cites work: Q4739659
cites work: Minimization of functions having Lipschitz continuous first partial derivatives
cites work: Factorizing symmetric indefinite matrices
cites work: Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
cites work: Quasi-Newton Methods and their Application to Function Minimisation
cites work: A Projected Lagrangian Algorithm for Nonlinear $l_1 $ Optimization
cites work: On an algorithm for discrete nonlinear L1 approximation
cites work: Combined LP and Quasi-Newton Methods for Nonlinear $l_1 $ Optimization
cites work: An Algorithm for $l_1 $-Norm Minimization with Application to Nonlinear $l_1 $-Approximation
cites work: Robust Statistics
cites work: Q5185900
cites work: The Minimax Solution of an Overdetermined System of Non-linear Equations
cites work: Discrete Chebyshev Approximation with Linear Constraints
cites work: A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization
cites work: Q4130283
cites work: A globally convergent method for nonlinear programming
full work available at URL: https://doi.org/10.1007/bf00938528
OpenAlex ID: W2076493176
Recommended article: Q3337232
Recommended article: On penalty function methods for nonlinear programming problems
Recommended article: Q5319003
Recommended article: Q3972960
Recommended article: Q3494384
Recommended article: A note on solving nonlinear minimax problems via a differentiable penalty function
Recommended article: A Continuously Differentiable Exact Penalty Function for Nonlinear Programming Problems with Inequality Constraints
Recommended article: Q4979589
Recommended article: OPTIMIZATION OF NONLINEAR PROGRAMMING PROBLEMS USING PENALTY FUNCTIONS AND COMPLEX METHOD
Recommended article: Exact penalty function for nonlinear programming problems
description: scientific article; zbMATH DE number 3999671