Interior-point augmented Lagrangian methods for constrained optimization

The interior-point approach is one kind of the most important and effective methods for nonlinear inequality-constrained optimization, whereas classic augmented Lagrangian methods are very efficient in solving nonlinear equality-constrained optimization and convex optimization. The new research has shown that the interior-point augmented Lagrangian function can be of very nice higher-order smoothness, and is convex when the original optimization problem is convex. These nice properties make the novel augmented Lagrangian applicable and effective not only for convex optimization but also for non-convex optimization problems. In this paper, we provide an overview of our recent research progress about the interior-point augmented Lagrange function methods on the non-convex and convex optimization, and point out prospects for future research directions.

Authors

Publication Details

Journal
Scientia Sinica Mathematica
Published
2024-11-21
DOI
https://doi.org/10.1360/ssm-2024-0132
Primary Topic
Advanced Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Interior-point augmented Lagrangian methods for constrained optimization

Xinwei Liu, Yuhong Dai
Scientia Sinica Mathematica
Advanced Optimization Algorithms Research
article

Interior-point augmented Lagrangian methods for constrained optimization

Xinwei Liu, Yuhong Dai
article en

Abstract

The interior-point approach is one kind of the most important and effective methods for nonlinear inequality-constrained optimization, whereas classic augmented Lagrangian methods are very efficient in solving nonlinear equality-constrained optimization and convex optimization. The new research has shown that the interior-point augmented Lagrangian function can be of very nice higher-order smoothness, and is convex when the original optimization problem is convex. These nice properties make the novel augmented Lagrangian applicable and effective not only for convex optimization but also for non-convex optimization problems. In this paper, we provide an overview of our recent research progress about the interior-point augmented Lagrange function methods on the non-convex and convex optimization, and point out prospects for future research directions.

Scientia Sinica MathematicaVol. 55(2)
Openalex Percentile: Top 68%
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.

Interior-point augmented Lagrangian methods for constrained optimization — Xinwei Liu, Yuhong Dai · Scientia Sinica Mathematica (2024) | TGRS Research Map | TGRS