scientific article; zbMATH DE number 2121575

zbMath1140.90001MaRDI QIDQ4830373

Dimitri P. Bertsekas, Angelia Nedić, Asuman Ozdaglar

Publication date: 9 December 2004

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to operations research and mathematical programming (90-00)

Related Items

Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints, Characterizations of the solution set for tangentially convex optimization problems, Circumcentric directions of cones, Nonparametric estimation of distributions and diagnostic accuracy based on group‐tested results with differential misclassification, Second-order enhanced optimality conditions and constraint qualifications, Weighted Bayesian bootstrap for scalable posterior distributions, Distributed proximal‐gradient algorithms for nonsmooth convex optimization of second‐order multiagent systems, Improved variance reduction extragradient method with line search for stochastic variational inequalities, Optimal consensus for uncertain high‐order multi‐agent systems by output feedback, An adaptive sampling augmented Lagrangian method for stochastic optimization with deterministic constraints, Maximal Monotonicity and Cyclic Involutivity of Multiconjugate Convex Functions, Optimality Conditions for E-Convex Interval-Valued Programming Problem Using gH-Symmetrical Derivative, A fixed step distributed proximal gradient push‐pull algorithm based on integral quadratic constraint, The generalized conditional gradient method for composite multiobjective optimization problems on Riemannian manifolds, A varying-parameter fixed-time gradient-based dynamic network for convex optimization, An asynchronous subgradient-proximal method for solving additive convex optimization problems, Game-theoretical approach for task allocation problems with constraints, Duality Gap Estimation via a Refined Shapley--Folkman Lemma, A conforming virtual element method based on unfitted meshes for the elliptic interface problem, Local navigation-like functions for safe robot navigation in bounded domains with unknown convex obstacles, Theoretical analysis of classic and capacity constrained fuzzy clustering, No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization, Deep learning for natural language processing: a survey, Event-triggered distributed Nash equilibrium seeking over directed graphs and its application to power management, Polyhedral estimation of \(\mathcal{L}_1\) and \(\mathcal{L}_\infty\) incremental gains of nonlinear systems, Characterizing shadow price via Lagrange multiplier for nonsmooth problem, Directional shadow price in linearly constrained nonconvex optimization models, A weighted gradient model with total variation regularization for multi-focus image fusion, Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization, Overcoming backstepping limitations via a novel MIMO non-affine-in-control convex optimization technique, Overcoming non‐convexity of the robust nonlinear output feedback problem: An adaptive linear matrix inequality solution, Informative Lagrange multipliers in nonlinear parametric programming models, Best approximation with geometric constraints, Closedness under addition for families of quasimonotone operators, Lagrangian duality in convex conic programming with simple proofs, OPTIMAL MEAN–VARIANCE REINSURANCE WITH COMMON SHOCK DEPENDENCE, Unnamed Item, Unnamed Item, Inexact proximal stochastic second-order methods for nonconvex composite optimization, The Trimmed Lasso: Sparse Recovery Guarantees and Practical Optimization by the Generalized Soft-Min Penalty, Unnamed Item, A zonotopic framework for functional abstractions, Unnamed Item, Second-order optimality conditions and Lagrange multiplier characterizations of the solution set in quasiconvex programming, Optimality Conditions for Nonconvex Constrained Optimization Problems, Unnamed Item, Asynchronous Algorithms for Computing Equilibrium Prices in a Capital Asset Pricing Model, An Iterative Rank Penalty Method for Nonconvex Quadratically Constrained Quadratic Programs, Exact Augmented Lagrangian Duality for Mixed Integer Quadratic Programming, On the Computation of Set-Induced Control Lyapunov Functions for Continuous-Time Systems, A dual approach for optimal algorithms in distributed optimization over networks, Incremental Quasi-Subgradient Method for Minimizing Sum of Geodesic Quasi-Convex Functions on Riemannian Manifolds with Applications, Single Bregman projection method for solving variational inequalities in reflexive Banach spaces, A Global Dual Error Bound and Its Application to the Analysis of Linearly Constrained Nonconvex Optimization, Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach, Dissecting the duality gap: the supporting hyperplane interpretation revisited, Local saddle points for unconstrained polynomial optimization, On scaled stopping criteria for a safeguarded augmented Lagrangian method with theoretical guarantees, A survey on some recent developments of alternating direction method of multipliers, Convergence of inexact quasisubgradient methods with extrapolation, Convergence of two simple methods for solving monotone inclusion problems in reflexive Banach spaces, An approximate lower order penalty approach for solving second-order cone linear complementarity problems, The developments of proximal point algorithms, A common solution of generalized equilibrium, zeros of monotone mapping and fixed point problems, An extended delayed weighted gradient algorithm for solving strongly convex optimization problems, The saddle point problem of polynomials, A theoretical justification of the set covering greedy heuristic of Caprara et al., Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs, Regularized dual gradient distributed method for constrained convex optimization over unbalanced directed graphs, The convex geometry of linear inverse problems, Non-indexability of the stochastic appointment scheduling problem, An analysis of the stress formula for energy-momentum methods in nonlinear elastodynamics, A dual gradient-projection algorithm for model predictive control in fixed-point arithmetic, Minimal time functions and the smallest intersecting ball problem with unbounded dynamics, Optimality conditions in convex optimization revisited, Negativity bounds for Weyl-Heisenberg quasiprobability representations, Data-driven robust optimization, Sign projected gradient flow: a continuous-time approach to convex optimization with linear equality constraints, Convergence results of forward-backward method for a zero of the sum of maximally monotone mappings in Banach spaces, Fine tuning Nesterov's steepest descent algorithm for differentiable convex programming, Consistency of logistic classifier in abstract Hilbert spaces, Global optimality conditions for cubic minimization problem with box or binary constraints, The effect of deterministic noise in subgradient methods, Properties of the sign gradient descent algorithms, Minimax robust optimal estimation fusion for distributed multisensor systems with a relative entropy uncertainty, The split feasibility problem and its solution algorithm, Total variation image restoration method based on subspace optimization, Generalized lower-order penalty algorithm for solving second-order cone mixed complementarity problems, Deterministic global optimization with artificial neural networks embedded, Nonparametric shape-restricted regression, Primal-dual incremental gradient method for nonsmooth and convex optimization problems, Strongly stable C-stationary points for mathematical programs with complementarity constraints, Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization, Risk-averse model predictive control, Initialization-free privacy-guaranteed distributed algorithm for economic dispatch problem, Proximal point method for a special class of nonconvex multiobjective optimization functions, \(\mathcal{UV}\)-theory of a class of semidefinite programming and its applications, An interior point sequential quadratic programming-type method for log-determinant semi-infinite programs, Approximation of a common \(f\)-fixed point of \(f\)-pseudocontractive mappings in Banach spaces, Robust hypothesis testing for asymmetric nominal densities under a relative entropy tolerance, Distributed constrained stochastic subgradient algorithms based on random projection and asynchronous broadcast over networks, A convex optimization model and algorithm for retinex, Modified algorithms for image inpainting in Fourier transform domain, Computing equilibrium prices for a capital asset pricing model with heterogeneous beliefs and margin-requirement constraints, VI-constrained hemivariational inequalities: distributed algorithms and power control in ad-hoc networks, Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation, Convergence and error estimates for time-discrete consensus-based optimization algorithms, Homogeneous penalizers and constraints in convex image restoration, A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences, Lyapunov-type least-squares problems over symmetric cones, Templates for convex cone problems with applications to sparse signal recovery, Restoration of blurred color images with impulse noise, Efficient multiplicative noise removal method using isotropic second order total variation, A new variational approach for restoring images with multiplicative noise, Total variation with overlapping group sparsity for deblurring images under Cauchy noise, A novel convex dual approach to three-dimensional assignment problem: theoretical analysis, Tighter McCormick relaxations through subgradient propagation, Generalized polyhedral convex optimization problems, Robust constrained best approximation with nonconvex constraints, The distance between convex sets with Minkowski sum structure: application to collision detection, Convergence rates for an inexact ADMM applied to separable convex optimization, Convex envelopes for edge-concave functions, Using generalized cross validation to select regularization parameter for total variation regularization problems, A time-consistent Benders decomposition method for multistage distributionally robust stochastic optimization with a scenario tree structure, A power penalty method for second-order cone linear complementarity problems, An interior point-proximal method of multipliers for convex quadratic programming, Robust stochastic optimization with convex risk measures: a discretized subgradient scheme, Fixed point quasiconvex subgradient method, Image restoration with a high-order total variation minimization method, Feature scaling via second-order cone programming, Tensor train rank minimization with nonlocal self-similarity for tensor completion, A nonlocal low rank model for Poisson noise removal, Primal-dual splitting method for high-order model with application to image restoration, Toward fast transform learning, Robustness of learning algorithms using hinge loss with outlier indicators, Inexact stochastic subgradient projection method for stochastic equilibrium problems with nonmonotone bifunctions: application to expected risk minimization in machine learning, Lagrange multiplier characterizations of constrained best approximation with infinite constraints, A spectral method of the analysis of linear control systems, An exact handling of the gradient for overcoming persistent problems in nonlinear observer design via convex optimization techniques, Design of optimal utility of wireless rechargeable sensor networks via joint spatiotemporal scheduling, Decentralized hierarchical constrained convex optimization, Stochastic DCA for minimizing a large sum of DC functions with application to multi-class logistic regression, A variational model with hybrid hyper-Laplacian priors for Retinex, Saddle points of rational functions, A constrained consensus based optimization algorithm and its application to finance, Fast global minimization of the Chan-Vese model for image segmentation problem, New regularization models for image denoising with a spatially dependent regularization parameter, Deep relaxation: partial differential equations for optimizing deep neural networks, Template polyhedra and bilinear optimization, A convergent finite difference method for computing minimal Lagrangian graphs, Optimal utilization of ports' free-of-charge times in one distribution center and multiple ports inventory systems, Event-based model predictive control for nonlinear systems with dynamic disturbance, Uncertainty quantification of the 4th kind; optimal posterior accuracy-uncertainty tradeoff with the minimum enclosing ball, An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods, Decomposition of completely symmetric states, Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder), The log-exponential smoothing technique and Nesterov's accelerated gradient method for generalized Sylvester problems, Design and analysis of a potential-based controller for safe robot navigation in unknown GPS-denied environments with strictly convex obstacles, Sparse group Lasso and high dimensional multinomial classification, Quasi-relative interiors for graphs of convex set-valued mappings, New qualification conditions for convex optimization without convex representation, Variable selection in general multinomial logit models, Parallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappings, Stability and genericity for semi-algebraic compact programs, A heuristic for optimizing stochastic activity networks with applications to statistical digital circuit sizing, Robust adaptive attenuation of unknown periodic disturbances in uncertain multi-input multi-output systems, A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron, A Newton-like method for variable order vector optimization problems, A distributed simultaneous perturbation approach for large-scale dynamic optimization problems, Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings, On representations of the feasible set in convex optimization, Convex duality and calculus: Reduction to cones, Random access design for wireless control systems, Sharp MSE bounds for proximal denoising, Optimization over state feedback policies for robust control with constraints, DC programming and DCA for enhancing physical layer security via cooperative jamming, Introduction to sublinear analysis, Spatially dependent regularization parameter selection for total generalized variation-based image denoising, Enhanced Karush-Kuhn-Tucker condition and weaker constraint qualifications, SDP reformulation for robust optimization problems based on nonconvex QP duality, Mixed \(\ell_2\) and \(\ell_1\)-norm regularization for adaptive detrending with ARMA modeling, Univariate cubic \(L_1\) interpolating splines: analytical results for linearity, convexity and oscillation on 5-pointwindows, Univariate cubic \(L_1\) interpolating splines: spline functional, window size and analysis-based algorithm, Scale-invariant asset pricing and consumption/portfolio choice with general attitudes toward risk and uncertainty, Second-order optimality conditions for mathematical programs with equilibrium constraints, Techniques for exploring the suboptimal set, Mumford-Shah-TV functional with application in X-ray interior tomography, An FPTAS for optimizing a class of low-rank functions over a polytope, Convexity conditions and the Legendre-fenchel transform for the product of finitely many positive definite quadratic forms, Log-weight scheduling in switched networks, A fast truncated Lagrange method for large-scale image restoration problems, Dual decomposition for multi-agent distributed optimization with coupling constraints, New strong duality results for convex programs with separable constraints, An iterative Lagrange method for the regularization of discrete ill-posed inverse problems, Introduction to sublinear analysis. II: Symmetric case, Fast finite difference solvers for singular solutions of the elliptic Monge-Ampère equation, Models and algorithms for distributionally robust least squares problems, Distance majorization and its applications, A proximal alternating linearization method for minimizing the sum of two convex functions, Distributed stochastic subgradient projection algorithms for convex optimization, Trembles in extensive games with ambiguity averse players, Poisson noise removal scheme based on fourth-order PDE by alternating minimization algorithm, Multi-path utility maximization and multi-path TCP design, Smoothed state estimates under abrupt changes using sum-of-norms regularization, New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs, Distributed multi-agent optimization subject to nonidentical constraints and communication delays, Compact subdifferentials in Banach spaces and their applications to variational functionals, Optimization architecture for joint multi-path routing and scheduling in wireless mesh networks, Stabilization for Takagi-Sugeno fuzzy systems based on partitioning the range of fuzzy weights, Convex parametric piecewise quadratic optimization: theory and algorithms, On convex optimization without convex representation, A regularized strong duality for nonsymmetric semidefinite least squares problem, Distributed multi-agent optimization with state-dependent communication, Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation, Random algorithms for convex minimization problems, Incremental proximal methods for large scale convex optimization, Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations, Semidefinite complementarity reformulation for robust Nash equilibrium problems with Euclidean uncertainty sets, Quasi-Newton projection methods and the discrepancy principle in image restoration, First-order optimality condition of basis pursuit denoise problem, Subband adaptive filtering with \(l_1\)-norm constraint for sparse system identification, Delayed feedback control requires an internal forward model, Optimal investment and price dependence in a semi-static market, Farkas' lemma in random locally convex modules and Minkowski-Weyl type results in \(L^0(\mathcal F,R^n)\), Constructing positive reliable numerical solution for American call options: a new front-fixing approach, Variational analysis of directional minimal time functions and applications to location problems, A power penalty method for second-order cone nonlinear complementarity problems, Simplex-inspired algorithms for solving a class of convex programming problems, Path following in the exact penalty method of convex programming, A cyclic and simultaneous iterative method for solving the multiple-sets split feasibility problem, Characterizations of solution sets of cone-constrained convex programming problems, On the convexity of a class of quadratic mappings and its application to the problem of finding the smallest ball enclosing a given intersection of balls, Exact augmented Lagrangian duality for mixed integer linear programming, Some convex programs without a duality gap, On linear co-positive Lyapunov functions for sets of linear positive systems, Applications of variational analysis to a generalized Fermat-Torricelli problem, Robust semidefinite programming problems with general nonlinear parameter dependence: approaches using the DC-representations, Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms, Parametrized variational inequality approaches to generalized Nash equilibrium problems with shared constraints, Interpretation of Lagrange multipliers in nonlinear pricing problem, New results on Hermitian matrix rank-one decomposition, Intra market optimization for express package carriers with station to station travel and proportional sorting, Segmentation of ARX-models using sum-of-norms regularization, A new algorithm for solving convex parametric quadratic programs based on graphical derivatives of solution mappings, Reachability analysis of linear systems using support functions, A new accelerated algorithm for ill-conditioned ridge regression problems, Farkas' lemma for separable sublinear inequalities without qualifications, Conditions for boundedness in concave programming under reverse convex and convex constraints, Neighbourhood search for constructing Pareto sets, A continuum of commitment, Extended monotropic programming and duality, Semi-continuous quadratic optimization: existence conditions and duality scheme, Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences, A new approach to the weighted peak-constrained least-square error FIR digital filter optimal design problem, Subgradient methods for saddle-point problems, On the optimal separating hyperplane for arbitrary sets: a generalization of the SVM formulation and a convex hull approach, Convergence and stability of iteratively reweighted least squares for low-rank matrix recovery, Necessary and sufficient KKT optimality conditions in non-convex optimization, Newton projection method as applied to assembly simulation, Nonsmooth Constraint Qualifications for Nonconvex Inequality Systems, The Walrasian equilibrium and centralized distributed optimization in terms of modern convex optimization methods on the example of resource allocation problem, Least Median of Squares Solution of Multiple Linear Regression Models Through the Origin, Subgradient method with feasible inexact projections for constrained convex optimization problems, Low-Rank and Sparse Multi-task Learning, A new constrained optimization model for solving the nonsymmetric stochastic inverse eigenvalue problem, Inexact subgradient methods for quasi-convex optimization problems, COORDINATION OF AGRI-FOOD CHAIN WITH REVENUE-SHARING CONTRACT UNDER STOCHASTIC OUTPUT AND STOCHASTIC DEMAND, Pricing currency option based on the extension principle and defuzzification via weighting parameter identification, Parametrization of Random Vectors in Polynomial Chaos Expansions via Optimal Transportation, Inexact projected gradient method for vector optimization, Adaptive control allocation, On coordinating an assembly system under random yield and random demand, Recovering Structured Signals in Noise: Least-Squares Meets Compressed Sensing, Graphically structured value-function compilation, Two-scale method for the Monge-Ampère equation: Convergence to the viscosity solution, Adaptive Sampling Strategies for Stochastic Optimization, Unnamed Item, Exact matrix completion via convex optimization, Computation algorithm for convex semi-infinite program with second-order cones: special analyses for affine and quadratic case, Constrained continuous-time Markov decision processes on the finite horizon, Dual S-matrix bootstrap. Part I. 2D theory, Comment on: ``Centers of quasi-homogeneous polynomial planar systems, Optimal time trajectory and coordination for connected and automated vehicles, A space decomposition scheme for maximum eigenvalue functions and its applications, Radius of robust global error bound for piecewise linear inequality systems, Byzantine-resilient distributed state estimation: a min-switching approach, Distributed constraint-coupled optimization via primal decomposition over random time-varying graphs, Distributed Model Predictive Control of linear discrete-time systems with local and global constraints, Computing shadow prices with multiple Lagrange multipliers, Incremental gradient-free method for nonsmooth distributed optimization, Stackelberg population dynamics: a predictive-sensitivity approach, A new approach for Cauchy noise removal, Enhanced Fritz John stationarity, new constraint qualifications and local error bound for mathematical programs with vanishing constraints, On substitutability and complementarity in discrete choice models, Proximal gradient methods for multiobjective optimization and their applications, Generalized differentiation and duality in infinite dimensions under polyhedral convexity, Characterizations of solution sets of differentiable quasiconvex programming problems, Dynamic non-diagonal regularization in interior point methods for linear and convex quadratic programming, Book review of: B. S. Mordukhovich and N. M. Nam, Convex analysis and beyond. Volume I. Basic theory, On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems, Multi-cluster distributed optimization via random sleep strategy, Alternating Krylov subspace image restoration methods, Lagrangian relaxations on networks by \(\varepsilon \)-subgradient methods, Two-stage time-optimal formation reconfiguration strategy, COMPUTING THE CONVEX ENVELOPE USING A NONLINEAR PARTIAL DIFFERENTIAL EQUATION, RIPless compressed sensing from anisotropic measurements, An alternating linearization method with inexact data for bilevel nonsmooth convex optimization, On decentralized negotiation of optimal consensus, Unnamed Item, Pricing of claims in discrete time with partial information, An explicit solution of the Lipschitz extension problem, Concavely-Priced Timed Automata, The Approximate Duality Gap Technique: A Unified Theory of First-Order Methods, Convergent Two-Scale Filtered Scheme for the Monge--Ampère Equation, On the choice of parameters for the weighting method in vector optimization, Continuous selection and unique polyhedral representation of solutions to convex parametric quadratic programs, A geometric framework for nonconvex optimization duality using augmented Lagrangian functions, Extending scope of robust optimization: comprehensive robust counterparts of uncertain problems, Worst-case large-deviation asymptotics with application to queueing and information theory, Workload reduction of a generalized Brownian network, Graph Implementations for Nonsmooth Convex Programs, Distributed Robust Subspace Recovery, Granular self-organizing map (grSOM) for structure identification, A Subgradient Method Based on Gradient Sampling for Solving Convex Optimization Problems, Stochastic First-Order Methods with Random Constraint Projection, A New Algorithm Framework for Image Inpainting in Transform Domain, A variable metric proximal-descent algorithm for monotone operators, Optimal Call Admission Control for an IEEE 802.16 Wireless Metropolitan Area Network, A Lagrangian-ACO matheuristic for car sequencing, Clarke directional derivatives of regularized gap functions for nonsmooth quasi-variational inequalities, On risk bounds in isotonic and other shape restricted regression problems, Algorithm 996, Value and Policy Function Approximations in Infinite-Horizon Optimization Problems, Optimal survey schemes for stochastic gradient descent with applications to M-estimation, A projected gradient method for optimization over density matrices, Convergence of a first-order consensus-based global optimization algorithm, Subgradients of Minimal Time Functions without Calmness, Incremental subgradient method for nonsmooth convex optimization with fixed point constraints, Simplex-type algorithm for second-order cone programmes via semi-infinite programming reformulation, Minimisation and Parameter Estimation in Image Restoration Variational Models with ℓ₁-Constraints, The Dirichlet problem for the convex envelope, Convergence Analysis of Approximate Primal Solutions in Dual First-Order Methods, Absorbing Continuous-Time Markov Decision Processes with Total Cost Criteria, Accelerated alternating minimization algorithm for Poisson noisy image recovery, AN IMPROVED CONVEX 0-1 QUADRATIC PROGRAM REFORMULATION FOR CHANCE-CONSTRAINED QUADRATIC KNAPSACK PROBLEMS, Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems, Weak subgradient method for solving nonsmooth nonconvex optimization problems, The convex envelope is the solution of a nonlinear obstacle problem, Incremental constraint projection methods for variational inequalities, Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization, On the correctness of monadic backward induction, Distributed Bregman-Distance Algorithms for Min-Max Optimization, Initialization and Curing Policies for Pólya Contagion Networks, Estimation fusion for distributed multi-sensor systems with uncertain cross-correlations, Mean Field Equilibrium: Uniqueness, Existence, and Comparative Statics