Weak optimal inverse problems of interval linear programming based on KKT conditions

In this paper,weak optimal inverse problems of interval linear programming(IvLP)are studied based on KKT conditions.Firstly,the problem is precisely defined.Specifically,by adjusting the minimum change of the current cost coefficient,a given weak solution can become optimal.Then,an equivalent characterization of weak optimal inverse IvLP problems is obtained.Finally,the problem is simplified without adjusting the cost coefficient of null variable.

Distributionally Robust Newsvendor Model for Fresh Products under Cap-and-Offset Regulation

The cap-and-offset regulation is a practical scheme to lessen carbon emissions.The retailer selling fresh products can adopt sustainable technologies to lessen greenhouse gas emissions.We aim to analyze the optimal joint strategies on order quantity and sustainable technology investment when the retailer faces stochastic market demand and can only acquire the mean and variance of distribution information.We construct a distributionally robust optimization model and use the Karush-Kuhn-Tucker(KKT)conditions to solve the analytic formula of optimal solutions.By comparing the models with and without investing in sustainable technologies,we examine the effect of sustainable technologies on the operational management decisions of the retailer.Finally,some computational examples are applied to analyze the impact of critical factors on operational strategies,and some managerial insights are given based on the analysis results.

Nonlinear Electrical Impedance Tomography Method Using a Complete Electrode Model for the Characterization of Heterogeneous Domains

This paper presents an electrical impedance tomography(EIT)method using a partial-differential-equationconstrained optimization approach.The forward problem in the inversion framework is described by a complete electrodemodel(CEM),which seeks the electric potential within the domain and at surface electrodes considering the contact impedance between them.The finite element solution of the electric potential has been validated using a commercial code.The inverse medium problem for reconstructing the unknown electrical conductivity profile is formulated as an optimization problem constrained by the CEM.The method seeks the optimal solution of the domain’s electrical conductivity to minimize a Lagrangian functional consisting of a least-squares objective functional and a regularization term.Enforcing the stationarity of the Lagrangian leads to state,adjoint,and control problems,which constitute the Karush-Kuhn-Tucker(KKT)first-order optimality conditions.Subsequently,the electrical conductivity profile of the domain is iteratively updated by solving the KKT conditions in the reduced space of the control variable.Numerical results show that the relative error of the measured and calculated electric potentials after the inversion is less than 1%,demonstrating the successful reconstruction of heterogeneous electrical conductivity profiles using the proposed EIT method.This method thus represents an application framework for nondestructive evaluation of structures and geotechnical site characterization.

A FAST CONVERGING SPARSE RECONSTRUCTION ALGORITHM IN GHOST IMAGING

A fast converging sparse reconstruction algorithm in ghost imaging is presented. It utilizes total variation regularization and its formulation is based on the Karush-Kuhn-Tucker (KKT) theorem in the theory of convex optimization. Tests using experimental data show that, compared with the algorithm of Gradient Projection for Sparse Reconstruction (GPSR), the proposed algorithm yields better results with less computation work.

Variational Analysis Based on Proximal Subdifferential on Smooth Banach Spaces

This paper first shows that for any p∈(1,2)there exists a continuously differentiable function f on l^(p)(and L^(p))such that the proximal subdifferential of f is empty everywhere,and hence it is not suitable to develop theory on proximal subdifferential in the classical Banach spaces l^(P)and L^(P) with p∈(1,2).On the other hand,this paper establishes variational analysis based on the proximal subdifferential in the framework of smooth Banach spaces of power type 2,which conclude all Hilbert spaces and all the classical spaces l^(P)and L^(P)with p∈(2,+∞).In particular,in such a smooth space,we provide the proximal subdifferential rules for sum functions,product functions,composite functions and supremum functions,which extend the basic results on the proximal subdifferential established in the framework of Hilbert spaces.Some of our main results are new even in the Hilbert space case.As applications,we provide KKT-like conditions for nonsmooth optimization problems in terms of proximal subdifferential.

Network Lifetime Global Optimization for Multi-Source and Single-Sink Topology in Wireless Sensor Networks

The multi-source and single-sink(MSSS) topology in wireless sensor networks(WSNs) is defined as a network topology,where all of nodes can gather,receive and transmit data to the sink.In energy-constrained WSNs with such a topology,the joint optimal design in the physical,medium access control(MAC) and network layers is considered for network lifetime maximization(NLM).The problem of integrating multi-layer information to compute NLM,which involves routing flow,link schedule and transmission power,is formulated as a nonlinear optimization problem.Specially under time division multiple access(TDMA) scheme,this problem can be transformed into a convex optimization problem.To solve it analytically we make use of the property that local optimization is global optimization in convex problem.This allows us to exploit the Karush-Kuhn-Tucker (KKT) optimality conditions to solve it and obtain analytical solution expression,i.e.,the globally optimal network lifetime(NL).NL is derived as a function of number of nodes,their initial energy and data rate arrived at them. Based on the analysis of analytical approach,it takes the influence of data rates,link access and routing method over NLM into account.Moreover,the globally optimal transmission schemes are achieved by solution set during analytical approach and applied to algorithms in TDMA-based WSNs aiming at NLM on OMNeT++ to compare with other suboptimal schemes.