A note on optimization in ℝⁿ

2019/02/23 by Fabio Botelho, Botelho, Fabio
Computer Science · Mathematics · #49M05 #49M15 #Advanced Optimization Algorithms Research #FOS: Mathematics #Fixed Point Theorems Analysis #Optimization and Control (math.OC) #Optimization and Variational Analysis

paper · pdf · doi:10.48550/arxiv.1902.08811

openalex publication_date 2019/02/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this article, we develop an algorithm suitable for constrained optimization in ℝⁿ. The results are developed through standard tools of n-dimensional real analysis and basic concepts of optimization. Indeed, the well known Banach fixed point theorem has a fundamental role in the main result establishment.

Related

• A Novel Algorithm for Linear Programming
• A Partial Exact Penalty Function Approach for Constrained Optimization
• A duality principle for non-convex optimization in ℝⁿ
• Constrained optimization through fixed point techniques
• On Lower and Upper Bounds for Smooth and Strongly Convex Optimization Problems