Publication:3102800

Publication date: 25 November 2011

linear programming; convex optimization; duality; convex sets; conjugate function; saddle point; subgradient; convex analysis; minimax theory; hyperplane separation; polyhedral convexity

Mathematics Subject Classification ID

90C25: Convex programming

52A41: Convex functions and convex programs in convex geometry

90-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming

Related Items

ADMM in Krylov Subspace and Its Application to Total Variation Restoration of Spatially Variant Blur, Vanishing Price of Decentralization in Large Coordinative Nonconvex Optimization, Essentials of numerical nonsmooth optimization, Essentials of numerical nonsmooth optimization, Robust Tensor Completion: Equivalent Surrogates, Error Bounds, and Algorithms, Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity, Computable centering methods for spiraling algorithms and their duals, with motivations from the theory of Lyapunov functions, Stochastic approximation with nondecaying gain: Error bound and data‐driven gain‐tuning, Two-timescale recurrent neural networks for distributed minimax optimization, Self-evident events and the value of linking, On sufficient conditions for spanning structures in dense graphs, Minimax Problems with Coupled Linear Constraints: Computational Complexity and Duality, Distributionally robust mean-absolute deviation portfolio optimization using Wasserstein metric, Bidding to procure supply in newsvendor networks, Generalized truncated moment problems with unbounded sets, A line search based proximal stochastic gradient algorithm with dynamical variance reduction, Port-Hamiltonian Systems Theory and Monotonicity, The forward-backward envelope for sampling with the overdamped Langevin algorithm, Asymptotic Properties of Primal-Dual Algorithm for Distributed Stochastic Optimization over Random Networks with Imperfect Communications, Consistency of the Scenario Approach, A note on strict complementarity for the doubly non-negative cone, Accelerated method for optimization over density matrices in quantum state estimation, Unnamed Item, Unnamed Item, A Linear-algebraic Proof of Hilbert’s Ternary Quartic Theorem, Conic Programming Reformulations of Two-Stage Distributionally Robust Linear Programs over Wasserstein Balls, Robust Optimization for Electricity Generation, Distributed primal-dual optimisation method with uncoordinated time-varying step-sizes, Distributionally Robust Inverse Covariance Estimation: The Wasserstein Shrinkage Estimator, A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer, Stochastic recursive inclusions with non-additive iterate-dependent Markov noise, Analysis of the Implicit Euler Time-Discretization of Semiexplicit Differential-Algebraic Linear Complementarity Systems, Duality Gap Estimation via a Refined Shapley--Folkman Lemma, Solution uniqueness of convex piecewise affine functions based optimization with applications to constrained ℓ₁ minimization, Asynchronous Optimization over Weakly Coupled Renewal Systems, The Weighted Nonnegative Least-Squares Problem with Implicitly Characterized Points, Fair Packing and Covering on a Relative Scale, Hermitian Tensor Decompositions, On the Simplicity and Conditioning of Low Rank Semidefinite Programs, Safe nonlinear control design for input constrained polynomial systems using sum-of-squares programming, A Simple Counterexample to the Monge Ansatz in Multimarginal Optimal Transport, Convex Geometry of the Set of Kantorovich Plans, and the Frenkel--Kontorova Model, Regularization via Mass Transportation, Generalized maximum entropy estimation, Sensitivity analysis for stratified comparisons in an observational study of the effect of smoking on homocysteine levels, A decomposition method for large scale MILPs, with performance guarantees and a power system application, Bounding duality gap for separable problems with linear constraints, Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systems, Distance majorization and its applications, Revealed preference analysis for convex rationalizations on nonlinear budget sets, Primal-dual algorithm based on Gauss-Seidel scheme with application to multiplicative noise removal, Singular mass matrix and redundant constraints in unilaterally constrained Lagrangian and Hamiltonian systems, Smooth strongly convex interpolation and exact worst-case performance of first-order methods, Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization, Inexact proximal Newton methods for self-concordant functions, Relational models for contingency tables, Incremental proximal methods for large scale convex optimization, A new steplength selection for scaled gradient methods with application to image deblurring, Distributed robust adaptive equilibrium computation for generalized convex games, A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees, An improved multi-parametric programming algorithm for flux balance analysis of metabolic networks, A dual gradient-projection algorithm for model predictive control in fixed-point arithmetic, Capacity of random channels with large alphabets, Privacy preserving distributed optimization using homomorphic encryption, Sub-sampled Newton methods, Constrained minimum variance control for discrete-time stochastic linear systems, The convexification effect of Minkowski summation, Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations, Reconstruction of 3D X-ray CT images from reduced sampling by a scaled gradient projection algorithm, A new algorithm for distributed control problem with shortest-distance constraints, On the convergence of primal-dual hybrid gradient algorithms for total variation image restoration, Streaming graph computations with a helpful advisor, Convex envelopes generated from finitely many compact convex sets, Generalized polyhedral convex optimization problems, Inexact proximal $\epsilon$-subgradient methods for composite convex optimization problems, Solving nearly-separable quadratic optimization problems as nonsmooth equations, Geometry of Kantorovich polytopes and support of optimizers for repulsive multi-marginal optimal transport on finite state spaces, Total generalized variation denoising of speckled images using a primal-dual algorithm, Estimating variances in time series kriging using convex optimization and empirical BLUPs, A feasibility-ensured Lagrangian heuristic for general decomposable problems, A total variation regularization method for inverse source problem with uniform noise, Efficient iterative method for SOAV minimization problem with linear equality and box constraints and its linear convergence, Continuity of derivatives of a convex solution to a perturbed one-Laplace equation by $p$-Laplacian, Convergence of proximal solutions for evolution inclusions with time-dependent maximal monotone operators, Nash social distancing games with equity constraints: how inequality aversion affects the spread of epidemics, Shearlet-TGV based model for restoring noisy images corrupted by Cauchy noise, A simple proof of the discrete time geometric Pontryagin maximum principle on smooth manifolds, Isotropic sparse regularization for spherical harmonic representations of random fields on the sphere, Distributionally robust optimization with polynomial densities: theory, models and algorithms, On the complexity of detecting convexity over a box, Resilient consensus in multi-agent systems with state constraints, Constrained total variation based three-dimension single particle reconstruction in cryogenic electron microscopy, On the sensitivity of the optimal partition for parametric second-order conic optimization, The zero duality gap property for an optimal control problem governed by a multivalued hemivariational inequality, Minimization of a class of rare event probabilities and buffered probabilities of exceedance, A primal-dual multiplier method for total variation image restoration, Robust modifications of U-statistics and applications to covariance estimation problems, Douglas-Rachford splitting and ADMM for pathological convex optimization, The contact problem in Lagrangian systems with redundant frictional bilateral and unilateral constraints and singular mass matrix. The all-sticking contacts problem, On pathological disjunctions and redundant disjunctive conic cuts, Application of an augmented Lagrangian approach to multibody systems with equality motion constraints, On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems, Certification aspects of the fast gradient method for solving the dual of parametric convex programs, How to solve a design centering problem, Iterative method for estimating the robust domains of attraction of non-linear systems: application to cancer chemotherapy model with parametric uncertainties, Primal-dual algorithms for total variation based image restoration under Poisson noise, Intrinsic formulation and Lagrange duality for elastic cable networks with geometrical nonlinearity, Distributionally robust fault detection design and assessment for dynamical systems, Distributed optimal resource allocation over strongly connected digraphs: a surplus-based approach, Computation of the maximal invariant set of discrete-time linear systems subject to a class of non-convex constraints, Subgradient averaging for multi-agent optimisation with different constraint sets, Scaling Techniques for $\epsilon$-Subgradient Methods, A Variable Metric Forward-Backward Method with Extrapolation, A Network of Spiking Neurons for Computing Sparse Representations in an Energy-Efficient Way, Approximate policy iteration: a survey and some new methods, Breaking the Curse of Dimension in Multi-Marginal Kantorovich Optimal Transport on Finite State Spaces, Stochastic Recursive Inclusions in Two Timescales with Nonadditive Iterate-Dependent Markov Noise, Resource Allocation in Communication Networks with Large Number of Users: The Dual Stochastic Gradient Method, Easily Parallelizable and Distributable Class of Algorithms for Structured Sparsity, with Optimal Acceleration