Newton Iteration with Weighted Exponential Penalty Function for Solving Multi-Objective Constrained Optimization Problems

In this paper, the Newton iterative method and weighted exponential penalty function method for solving multi-objective constrained optimization problems are proposed on the basis of classical optimization methods for mathematical planning.Firstly, according to the characteristics of the objective function, it is transformed into a single-objective constrained optimization problem using variable weight coefficients.Then according to the characteristics of the constraints, the exponential penalty function method is used to transform it into an unconstrained optimization problem.Finally, Newton's method is used to solve the transformed unconstrained optimization problem to obtain the efficient Pareto solution of the original problem.The convergence of the method is included in the paper, and numerical experiments show that our proposed method can obtain a set of effective Pareto solutions corresponding to multi-objective optimization problems in different dimensions.

Publication Details

Journal
Jurnal pengukuran kualiti dan analisis/Journal of Quality Measurement and Analysis
Published
2025-06-21
DOI
https://doi.org/10.17576/jqma.2102.2025.08
Primary Topic
Advanced Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Newton Iteration with Weighted Exponential Penalty Function for Solving Multi-Objective Constrained Optimization Problems

Jurnal pengukuran kualiti dan analisis/Journal of Quality Measurement and Analysis
Advanced Optimization Algorithms Research
article

Newton Iteration with Weighted Exponential Penalty Function for Solving Multi-Objective Constrained Optimization Problems

article en

Abstract

In this paper, the Newton iterative method and weighted exponential penalty function method for solving multi-objective constrained optimization problems are proposed on the basis of classical optimization methods for mathematical planning.Firstly, according to the characteristics of the objective function, it is transformed into a single-objective constrained optimization problem using variable weight coefficients.Then according to the characteristics of the constraints, the exponential penalty function method is used to transform it into an unconstrained optimization problem.Finally, Newton's method is used to solve the transformed unconstrained optimization problem to obtain the efficient Pareto solution of the original problem.The convergence of the method is included in the paper, and numerical experiments show that our proposed method can obtain a set of effective Pareto solutions corresponding to multi-objective optimization problems in different dimensions.

Jurnal pengukuran kualiti dan analisis/Journal of Quality Measurement and AnalysisVol. 21(2)
Universiti Malaysia Sabah
Reduced inequalities
Openalex Percentile: Top 78%
Advanced Optimization Algorithms Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Newton Iteration with Weighted Exponential Penalty Function for Solving Multi-Objective Constrained Optimization Problems · Jurnal pengukuran kualiti dan analisis/Journal of Quality Measurement and Analysis (2025) | TGRS Research Map | TGRS