scientific article; zbMATH DE number 2121575
From MaRDI portal
Publication:4830373
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.
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 (only showing first 100 items - show all)
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 ⋮ 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
This page was built for publication: