Paper
Newton Method for Multiobjective Optimization Problems of Interval-Valued Maps
Authors
Tapas Mondal, Debdas Ghosh, Do Sang Kim
Abstract
In this article, we propose a Newton-based method for solving multiobjective interval optimization problems (MIOPs). We first provide a connection between weakly Pareto optimal points and Pareto critical points in the context of MIOPs. Introducing this relationship, we develop an algorithm aimed at computing a Pareto critical point. The algorithm incorporates the computation of a descent direction at a non-Pareto critical point and employs an Armijo-like line search strategy to ensure sufficient decrease. Under suitable assumptions, we prove that the sequence generated by our proposed algorithm converges to a Pareto critical point. The effectiveness and performance of the proposed method are demonstrated through a series of numerical experiments on some test problems. Finally, we apply our proposed algorithm in a portfolio optimization problem with interval uncertainty.
Metadata
Related papers
Cosmic Shear in Effective Field Theory at Two-Loop Order: Revisiting $S_8$ in Dark Energy Survey Data
Shi-Fan Chen, Joseph DeRose, Mikhail M. Ivanov, Oliver H. E. Philcox • 2026-03-30
Stop Probing, Start Coding: Why Linear Probes and Sparse Autoencoders Fail at Compositional Generalisation
Vitória Barin Pacela, Shruti Joshi, Isabela Camacho, Simon Lacoste-Julien, Da... • 2026-03-30
SNID-SAGE: A Modern Framework for Interactive Supernova Classification and Spectral Analysis
Fiorenzo Stoppa, Stephen J. Smartt • 2026-03-30
Acoustic-to-articulatory Inversion of the Complete Vocal Tract from RT-MRI with Various Audio Embeddings and Dataset Sizes
Sofiane Azzouz, Pierre-André Vuissoz, Yves Laprie • 2026-03-30
Rotating black hole shadows in metric-affine bumblebee gravity
Jose R. Nascimento, Ana R. M. Oliveira, Albert Yu. Petrov, Paulo J. Porfírio,... • 2026-03-30
Raw Data (Debug)
{
"raw_xml": "<entry>\n <id>http://arxiv.org/abs/2603.06000v1</id>\n <title>Newton Method for Multiobjective Optimization Problems of Interval-Valued Maps</title>\n <updated>2026-03-06T08:00:00Z</updated>\n <link href='https://arxiv.org/abs/2603.06000v1' rel='alternate' type='text/html'/>\n <link href='https://arxiv.org/pdf/2603.06000v1' rel='related' title='pdf' type='application/pdf'/>\n <summary>In this article, we propose a Newton-based method for solving multiobjective interval optimization problems (MIOPs). We first provide a connection between weakly Pareto optimal points and Pareto critical points in the context of MIOPs. Introducing this relationship, we develop an algorithm aimed at computing a Pareto critical point. The algorithm incorporates the computation of a descent direction at a non-Pareto critical point and employs an Armijo-like line search strategy to ensure sufficient decrease. Under suitable assumptions, we prove that the sequence generated by our proposed algorithm converges to a Pareto critical point. The effectiveness and performance of the proposed method are demonstrated through a series of numerical experiments on some test problems. Finally, we apply our proposed algorithm in a portfolio optimization problem with interval uncertainty.</summary>\n <category scheme='http://arxiv.org/schemas/atom' term='math.OC'/>\n <published>2026-03-06T08:00:00Z</published>\n <arxiv:comment>33 pages and 3 figures</arxiv:comment>\n <arxiv:primary_category term='math.OC'/>\n <author>\n <name>Tapas Mondal</name>\n </author>\n <author>\n <name>Debdas Ghosh</name>\n </author>\n <author>\n <name>Do Sang Kim</name>\n </author>\n </entry>"
}