On solving three classes of nonlinear programming problems via simple differentiable penalty functions
From MaRDI portal
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.
Recommendations
- scientific article; zbMATH DE number 3869077
- On penalty function methods for nonlinear programming problems
- A differentiable and ``almost exact penalty function method for nonlinear programming
- scientific article; zbMATH DE number 16307
- scientific article; zbMATH DE number 4167856
- A note on solving nonlinear minimax problems via a differentiable penalty function
- A Continuously Differentiable Exact Penalty Function for Nonlinear Programming Problems with Inequality Constraints
- The differentiable exact penalty function for nonlinear semidefinite programming
- OPTIMIZATION OF NONLINEAR PROGRAMMING PROBLEMS USING PENALTY FUNCTIONS AND COMPLEX METHOD
- Exact penalty function for nonlinear programming problems
Cites work
- A globally convergent method for nonlinear programming
- A Projected Lagrangian Algorithm for Nonlinear l₁ Optimization
- A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization
- An Algorithm for l₁ -Norm Minimization with Application to Nonlinear l₁ -Approximation
- Combined LP and Quasi-Newton Methods for Nonlinear $l_1 $ Optimization
- Discrete Chebyshev Approximation with Linear Constraints
- Factorizing symmetric indefinite matrices
- scientific article; zbMATH DE number 3557086 (Why is no real title available?)
- scientific article; zbMATH DE number 3793774 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- scientific article; zbMATH DE number 3376990 (Why is no real title available?)
- Minimization of functions having Lipschitz continuous first partial derivatives
- On an algorithm for discrete nonlinear L1 approximation
- On the Accurate Determination of Search Directions for Simple Differentiable Penalty Functions
- Quasi-Newton Methods and their Application to Function Minimisation
- Robust Statistics
- Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
- The Minimax Solution of an Overdetermined System of Non-linear Equations
Cited in
(9)- Simple solution procedures for nonlinear programming problems that are derivative decomposable
- A new penalty function algorithm for convex quadratic programming
- A simple algorithm to incorporate transactions costs in quadratic optimization
- Maximizing pseudoconvex transportation problem: A special type
- Methods of reduced directions, based on a differentiable penalty function, for a problem of nonlinear programming
- On the Accurate Determination of Search Directions for Simple Differentiable Penalty Functions
- Scalable nonlinear programming via exact differentiable penalty functions and trust-region Newton methods
- A differentiable and ``almost exact penalty function method for nonlinear programming
- A note on solving nonlinear minimax problems via a differentiable penalty function
This page was built for publication: On solving three classes of nonlinear programming problems via simple differentiable penalty functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1821693)