scientific article

Publication date: 25 November 2011

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

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

Mathematics Subject Classification ID

Convex programming (90C25) Convex functions and convex programs in convex geometry (52A41) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)

Related Items

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