Convex optimization theory.
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Sensitivity analysis for stratified comparisons in an observational study of the effect of smoking on homocysteine levels
- Conjugate duality in convex optimization
- Fundamentals of convex analysis. Duality, separation, representation, and resolution
- Convex analysis and nonlinear optimization. Theory and examples
- 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
- Convex and stochastic optimization
- 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
- 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
- Duality for nonconvex approximation and optimization.
- A decomposition method for large scale MILPs, with performance guarantees and a power system application
- 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
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Scaling techniques for -subgradient methods
- A variable metric forward-backward method with extrapolation
- A network of spiking neurons for computing sparse representations in an energy-efficient way
- Bounding duality gap for separable problems with linear constraints
- 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
- Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systems
- Convex optimization algorithms
- Theory of Duality in Mathematical Programming
- scientific article; zbMATH DE number 47657 (Why is no real title available?)
- Distance majorization and its applications
- Revealed preference analysis for convex rationalizations on nonlinear budget sets
- 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
- scientific article; zbMATH DE number 2121575 (Why is no real title available?)
- Primal-dual algorithm based on Gauss-Seidel scheme with application to multiplicative noise removal
- A linear-algebraic proof of Hilbert's ternary quartic theorem
- Conic programming reformulations of two-stage distributionally robust linear programs over Wasserstein balls
- Singular mass matrix and redundant constraints in unilaterally constrained Lagrangian and Hamiltonian systems
- An introduction to convex optimization theory in communication signals recognition
- 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
- scientific article; zbMATH DE number 7625168 (Why is no real title available?)
- A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer
- Smooth strongly convex interpolation and exact worst-case performance of first-order methods
- Analysis of the implicit Euler time-discretization of a class of descriptor-variable linear cone complementarity systems
- 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 _1 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
This page was built for publication: Convex optimization theory.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3102800)
