arXiv subjects

Julio Deride

Publications and source records attributed to Julio Deride.

13 recordsLinked to original sources

arXiv2026

Rockafellian relaxation and minimum-norm slack for the Walrasian equilibrium problem

We propose a Rockafellian relaxation of the Walrasian equilibrium problem for an exchange economy that may not admit one. Market clearing is slackened by a non-negative variable $v$ whose norm is penalized; the relaxation is well posed throughout. As the penalty grows, the residual converges to a vector $v^*_\infty$ of minimum norm in the feasible range of excess demand, measuring the distance to the nearest equilibrium-admitting economy. A stressed Shapley--Shubik example recovers the analytical infeasibility floor to machine

math.OC↗

arXiv2026

Stability and Dual Valuation of Contingent Claims under Rockafellian Perturbations

We study the stability of solutions to the discrete-time contingent-claim problem over a finite investment horizon when uncertainty is modeled by random variables with finite discrete support. Our main contribution is to use Rockafellian perturbations as a framework for this stability analysis: we construct perturbations of the underlying probability distribution, of the contingent claim, and of both jointly, and we establish epi-convergence of the corresponding approximating Rockafellians for the primal problem. The associated hypo-convergent approximations yield stable dual problems which, in turn, imply convergence of the dual variables, interpreted as shadow prices. This analysis reveals a connection between the duality gap and the value of perfect information and it provides conditions under which strong duality holds. We also construct examples in which epi-convergence fails due to critical scenarios with vanishing probabilities but unbounded impacts, illustrating the boundary between well-behaved and ill-conditioned contingent-claim problems.

math.OC↗

arXiv2026

On the Value Function of Convex Bolza Problems Governed by Stochastic Difference Equations

In this paper we study the value function of Bolza problems governed by stochastic difference equations, with particular emphasis on the convex non-anticipative case. Our goal is to provide some insights on the structure of the subdiferential of the value function. In particular, we establish a connection between the evolution of the subgradients of the value function and a stochastic difference equation of Hamiltonian type. This result can be seen as a transposition of the method of characteristics, introduced by Rockafellar and Wolenski in the 2000s, to the stochastic discrete-time setting. Similarly as done in the literature for the deterministic case, the analysis is based on a duality approach. For this reason we study first a dual representation for the value function in terms of the value function of a dual problem, which is a pseudo Bolza problem. The main difference with the deterministic case is that (due to the non-anticipativity) the symmetry between the Bolza problem and its dual is no longer valid. This in turn implies that ensuring the existence of minimizers for the Bolza problem (which is a key point for establishing the method of characteristics) is not as simple as in the deterministic case, and it should be addressed differently. To complete the exposition, we study the existence of minimizers for a particular class of Bolza problems governed by linear stochastic difference equations, the so-called linear-convex optimal control problems.

math.OC↗

arXiv2024

Approximations of Rockafellians, Lagrangians, and Dual Functions

Solutions of an optimization problem are sensitive to changes caused by approximations or parametric perturbations, especially in the nonconvex setting. This paper shows that solutions of substitute problems, constructed from Rockafellian functions, can be less sensitive to such changes. Unlike classical stability analysis focused on local changes around (local) minimizers, we employ epi-convergence to examine whether approximating or perturbed problems suitably approach an actual (unperturbed) problem globally. \redrevvv{We demonstrate that solutions derived from the Rockafellian-based substitute problems converge to solutions of the actual optimization problem under suitable conditions, providing a rigorous alternative to potentially unstable direct approximations.} We quantify the rates of convergence that often lead to Lipschitz-kind stability properties for the substitute problems.

math.OC↗

arXiv2024

Subgradient evolution of value functions in discrete-time optimal control

In this paper we investigate how the subgradients of the value function of a discrete-time convex Bolza problem evolve over time. In particular, we develop a discrete-time version of the characteristic method introduced by Rockafellar and Wolenski in the 2000s, by showing that the time-evolution of the subgradients of the value functions can be associated with trajectories of a discrete-time Hamiltonian system. To do so, we first prove that the value function has a dual counterpart, which corresponds to the conjugate of the value function of a suitable dual problem. We finally make a discussion about the qualification conditions we require for our results, showing in particular that classical problems, such as the Liner-Quadratic regulator, satisfy these hypotheses.

math.OC↗

arXiv2023

A variational approach to a cumulative distribution function estimation problem under stochastic ambiguity

We propose a method for finding a cumulative distribution function (cdf) that minimizes the distance to a given cdf, while belonging to an ambiguity set constructed relative to another cdf and, possibly, incorporating soft information. Our method embeds the family of cdfs onto the space of upper semicontinuous functions endowed with the hypo-distance. In this setting, we present an approximation scheme based on epi-splines, defined as piecewise polynomial functions, and use bounds for estimating the hypo-distance. Under appropriate hypotheses, we guarantee that the cluster points corresponding to the sequence of minimizers of the resulting approximating problems are solutions to a limiting problem. We describe a large class of functions that satisfy these hypotheses. The approximating method produces a linear-programming-based approximation scheme, enabling us to develop an algorithm from off-the-shelf solvers. The convergence of our proposed approximation is illustrated by numerical examples for the bivariate case.

math.OC↗

arXiv2023

Solving equilibrium problems in economies with financial markets, home production, and retention

We propose a new methodology to compute equilibria for general equilibrium problems on exchange economies with real financial markets, home-production, and retention. We demonstrate that equilibrium prices can be determined by solving a related maxinf-optimization problem. We incorporate the non-arbitrage condition for financial markets into the equilibrium formulation and establish the equivalence between solutions to both problems. This reduces the complexity of the original by eliminating the need to directly compute financial contract prices, allowing us to calculate equilibria even in cases of incomplete financial markets. We also introduce a Walrasian bifunction that captures the imbalances and show that maxinf-points of this function correspond to equilibrium points. Moreover, we demonstrate that every equilibrium point can be approximated by a limit of maxinf points for a family of perturbed problems, by relying on the notion of lopsided convergence. Finally, we propose an augmented Walrasian algorithm and present numerical examples to illustrate the effectiveness of this approach. Our methodology allows for efficient calculation of equilibria in a variety of exchange economies and has potential applications in finance and economics.

math.OC↗

arXiv2023

Intermediate Service Facility Planning in a Stochastic and Competitive Market: Incorporating Agent-infrastructure Interactions over Networks

This paper presents a network-based multi-agent optimization model for the strategic planning of service facilities in a stochastic and competitive market. We focus on the type of service facilities that are of intermediate nature, i.e., users may need to deviate from the shortest path to receive/provide services in between the users' planned origins and destinations. This problem has many applications in emerging transportation mobility, including dynamic ride-sharing hub design and competitive facility location and allocation problems for alternative fuel vehicle refueling stations. The main contribution of this paper is establishing a new multi-agent optimization framework considering decentralized decision makings of facility investors and users over a transportation network and providing rigorous analyses of its mathematical properties, such as uniqueness and existence of system equilibrium. In addition, we develop an exact convex reformulation of the original multi-agent optimization problems to overcome computational challenges brought by non-convexity. Extensive analysis on case studies showed how the proposed model can capture the complex interaction between different stakeholders in an uncertain environment. Additionally, our model allowed quantifying the value of stochastic modeling and information availability by exploring stochastic metrics, including value of stochastic solution (VSS) and expected value of perfect information (EVPI), in a multi-agent framework.

math.OC↗

arXiv2020

Random Activations in Primal-Dual Splittings for Monotone Inclusions with a priori Information

In this paper, we propose a numerical approach for solving composite primal-dual monotone inclusions with a priori information. The underlying a priori information set is represented by the intersection of fixed point sets of a finite number of operators, and we propose and algorithm that activates the corresponding set by following a finite-valued random variable at each iteration. Our formulation is flexible and includes, for instance, deterministic and Bernoulli activations over cyclic schemes, and Kaczmarz-type random activations. The almost sure convergence of the algorithm is obtained by means of properties of stochastic Quasi-Fej\'er sequences. We also recover several primal-dual algorithms for monotone inclusions in the context without a priori information and classical algorithms for solving convex feasibility problems and linear systems. In the context of convex optimization with inequality constraints, any selection of the constraints defines the a priori information set, in which case the operators involved are simply projections onto half spaces. By incorporating random projections onto a selection of the constraints to classical primal-dual schemes, we obtain faster algorithms as we illustrate by means of a numerical application to a stochastic arc capacity expansion problem in a transport network.

math.OC↗

arXiv2020

A Primal-Dual Partial Inverse Splitting for Constrained Monotone Inclusions: Applications to stochastic Programming and Mean Field Games

In this work we study a constrained monotone inclusion involving the normal cone to a closed vector subspace and a priori information on primal solutions. We model this information by imposing that solutions belongs to the fixed point set of an averaged nonexpansive mapping. We characterize the solutions using an auxiliary inclusion that involves the partial inverse operator. Then, we propose the primal-dual partial inverse splitting and we prove its weak convergence to a solution of the inclusion, generalizing several methods in the literature. The efficiency of the proposed method is illustrated in two non-smooth convex optimization problems whose constraints have vector subspace structure. Finally, the proposed algorithm is applied to find a solution to a stochastic arc capacity expansion problem in transport networks.

math.OC↗

arXiv2020

One-Step Estimation With Scaled Proximal Methods

We study statistical estimators computed using iterative optimization methods that are not run until completion. Classical results on maximum likelihood estimators (MLEs) assert that a one-step estimator (OSE), in which a single Newton-Raphson iteration is performed from a starting point with certain properties, is asymptotically equivalent to the MLE. We further develop these early-stopping results by deriving properties of one-step estimators defined by a single iteration of scaled proximal methods. Our main results show the asymptotic equivalence of the likelihood-based estimator and various one-step estimators defined by scaled proximal methods. By interpreting OSEs as the last of a sequence of iterates, our results provide insight on scaling numerical tolerance with sample size. Our setting contains scaled proximal gradient descent applied to certain composite models as a special case, making our results applicable to many problems of practical interest. Additionally, our results provide support for the utility of the scaled Moreau envelope as a statistical smoother by interpreting scaled proximal descent as a quasi-Newton method applied to the scaled Moreau envelope.

math.OC↗

arXiv2016

Solving deterministic and stochastic equilibrium problems via augmented Walrasian

We described a method to solve deterministic and stochastic Walras equilibrium models based on associating with the given problem a bifunction whose maxinf-points turn out to be equilibrium points. The numerical procedure relies on an augmentation of this bifunction. Convergence of the proposed procedure is proved by relying on the relevant lopsided convergence. In the dynamic versions of our models, deterministic and stochastic, we are mostly concerned with models that equip the agents with a mechanism to transfer goods from one time period to the next, possibly simply savings, but also allows for the transformation of goods via production

math.OC↗

arXiv2016

Maximum a Posteriori Estimators as a Limit of Bayes Estimators

Maximum a posteriori and Bayes estimators are two common methods of point estimation in Bayesian Statistics. It is commonly accepted that maximum a posteriori estimators are a limiting case of Bayes estimators with 0-1 loss. In this paper, we provide a counterexample which shows that in general this claim is false. We then correct the claim that by providing a level-set condition for posterior densities such that the result holds. Since both estimators are defined in terms of optimization problems, the tools of variational analysis find a natural application to Bayesian point estimation.

math.ST↗