2022AIP conference proceedingsRequires access

A smoothing approximation method for classical l1 exact penalty function for optimization problems.

Darpan Sood, Amanpreet Singh

Open publisher page 0 citations

Abstract

The given manuscript deals with the development of a new smoothing technique for approximation of non- derivable l1 exact penalty functions for an optimization problem which is constrained in nature. The optimal solution of the problem framed from the original optimization problem as a smoothening optimization problem is proved to be identical to the original problem. Error estimation is done for smooth penalty problem, non-smooth penalty problem, and for the original problem. A procedure is developed to solve the constrained optimization problem consigned on the smoothing technique proposed in the paper. The convergence behaviour of the proposed procedure is also studied under soft conditions.

About this research paper

What this paper is about

The given manuscript deals with the development of a new smoothing technique for approximation of non- derivable l1 exact penalty functions for an optimization problem which is constrained in nature. The optimal solution of the problem framed from the original optimization problem as a smoothening optimization problem is proved to be identical to the original problem. Error estimation is done for smooth penalty problem, non-smooth penalty problem, and for the original problem. A procedure is developed to solve the constrained optimization problem consigned on the smoothing technique proposed in the paper. The convergence behaviour of the proposed procedure is also studied under soft conditions.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The given manuscript deals with the development of a new smoothing technique for approximation of non- derivable l1 exact penalty functions for an optimization problem which is constrained in nature. The optimal solution of the problem framed from the original optimization problem as a smoothening optimization problem is proved to be identical to the original problem. Error estimation is done for smooth penalty problem, non-smooth penalty problem, and for the original problem. A procedure is developed to solve the constrained optimization problem consigned on the smoothing technique proposed in the paper. The convergence behaviour of the proposed procedure is also studied under soft conditions.

Key concepts: Smoothing, Penalty method, Mathematical optimization, Optimization problem, Constrained optimization problem, Convergence (economics), Computer science, Constrained optimization

Related papers

Back to paper searchBrowse research topicsOriginal source
A smoothing approximation method for classical l1 exact penalty function for optimization problems. — Research Paper | ScholarLens