Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · math/0402445

Integral functionals on Sobolev spaces having multiple local minima

Biagio Ricceri
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, two multiplicity results about local minima of integrals of the calculus of variations are established. The main tool used to prove them is the theory developed in [B. Ricceri, Sublevel sets and global minima of coercive functionals and local minima of their pertubations, math.OC/0402444].

Explore related subjects

math.OC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Biagio Ricceri. 2004-02-26. Integral functionals on Sobolev spaces having multiple local minima. https://doi.org/10.1007/0-387-24276-7_55

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

A Path Planning Model for Intercepting a Moving Target with Finite Obstacle Avoidance

This paper investigates the problem of computing a two-dimensional curvature-constrained shortest path for an unmanned aerial vehicle (UAV) to intercept a moving target, with both the UAV (pursuer) and the target traveling at constant speeds. We formulate an optimal control problem that integrates two critical objectives: avoiding static obstacles and successfully intercepting the target. The formulation integrates curvature constraints, geometric obstacle-avoidance conditions, and time-consistent interception constraints within a constrained optimal control framework. A geometric framework is developed, along with necessary conditions for path optimality under the imposed constraints. The problem is initially examined in the presence of a single obstacle and later extended to scenarios involving a finite number of obstacles. Numerical experiments are carried out to evaluate the performance and efficiency of the proposed model using illustrative examples. Finally, we present a realistic case study using actual geographic data, including obstacle placement, target trajectory, and heading angles, to demonstrate the practical applicability and effectiveness of the proposed method in real-world scenarios.

math.OC↗
arXiv2026

Complete Characterizations of Well-Posedness in Parametric Composite Optimization

This paper characterizes the well-posedness of Karush-Kuhn-Tucker system for perturbed composite optimization. Using the parabolic regularity, we introduce a novel second-order variational function, shown to be the pivotal object governing second-order behavior. This foundational result yields the strong second-order sufficient condition introduced here for the general class of composite optimization problems to naturally extend the classical second-order sufficient condition in nonlinear programming. Then we obtain several equivalent characterizations of the second-order qualification condition (SOQC) and highlight its relationship with the constraint nondegeneracy condition under the $\mathcal{C}^{2}$-cone reducibility assumption. These insights lead us to multiple equivalent conditions for the major Lipschitz-like/Aubin property of KKT systems, including SOQC combined with the new second-order subdifferential condition and SOQC combined with tilt stability of local minimizers. Under the $\mathcal{C}^{2}$-cone reducibility, we settle the long-standing question by proving the equivalence between the Aubin property of KKT systems around local minimizers and the classical notion of strong regularity. Finally, we demonstrate that the Lipschitz-like property is equivalent to the nonsingularity of the generalized Jacobian associated with the KKT system under a certain verifiable assumption. These results provide a unified and rigorous framework for analyzing stability and sensitivity of solutions to composite optimization problems, as well as for the design and justification of numerical algorithms.

math.OC↗
arXiv2026

Approximate Dynamic Programming for Real-time Assignment of Extraboard Transit Operators

This study investigates real-time assignment decisions for extraboard transit operators, who are responsible for covering open work due to unexpected events such as driver absenteeism. Efficient usage of extraboard operators is critical as open work negatively affects service reliability. The problem is formulated as a Markov decision process, designed to capture its stochastic and sequential nature. Due to the problem's very large state space, an approximate policy is proposed in the form of an integer program, which maps a system state to assignment decisions such that the sum of immediate and expected future rewards is maximized. As part of off-line training, future value functions for individual operators are computed using a backward dynamic program. Then, the overestimation in the aggregate value obtained by summing individual values is corrected to account for the interaction among operators. Case studies are conducted based on the operations at a real-world transit agency. Key performance metrics including uncovered open work and extraboard utilization rates are examined for varying absenteeism rates and extraboard roster sizes. The approximate policy is shown to outperform benchmark decision rules mirroring real-world assignment strategies. Further numerical experiments are conducted to analyze different operational policies: (1) inclusion of overtime drivers in the reserve operator roster; (2) reward weights for work tasks that consider passenger wait time saved. Observations from these computational analyses provide actionable insights into extraboard sizing, overtime usage, and real-time dispatch practices at transit agencies.

math.OC↗