Lectures on Modern Convex Optimization

DOI10.1137/1.9780898718829zbMath0986.90032OpenAlexW1568307856MaRDI QIDQ2756075

Publication date: 12 November 2001

Full work available at URL: https://doi.org/10.1137/1.9780898718829

semidefinite programming convex programming conic programming conic quadratic programming large-scale programming

Semidefinite programming (90C22) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (only showing first 100 items - show all)

Integrated inventory control and facility location decisions in a multi-echelon supply chain network with hubs ⋮ Suboptimal anisotropic filtering in a finite horizon ⋮ Maximizing concave piecewise affine functions on the unitary group ⋮ Robust solutions to multi-facility Weber location problem under interval and ellipsoidal uncertainty ⋮ On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature ⋮ CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization ⋮ Computing the distance between the linear matrix pencil and the completely positive cone ⋮ A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron ⋮ Robust waveform design for MIMO radar with imperfect prior knowledge ⋮ Efficient formulations of the material identification problem using full-field measurements ⋮ Stability of discrete-time switching systems with constrained switching sequences ⋮ On sublinear inequalities for mixed integer conic programs ⋮ Assessment of hollow spheroid models for ductile failure prediction by limit analysis and conic programming ⋮ A practical nonlinear dynamic framework for solving a class of fractional programming problems ⋮ Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster ⋮ Lieb's concavity theorem, matrix geometric means, and semidefinite optimization ⋮ An optimal variant of Kelley's cutting-plane method ⋮ A robust model for a leader-follower competitive facility location problem in a discrete space ⋮ SDP reformulation for robust optimization problems based on nonconvex QP duality ⋮ Failure in accretionary wedges with the maximum strength theorem: numerical algorithm and 2D validation ⋮ A model-free no-arbitrage price bound for variance options ⋮ On the maximization of the fundamental eigenvalue in topology optimization ⋮ Sparse non Gaussian component analysis by semidefinite programming ⋮ Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization ⋮ Techniques for exploring the suboptimal set ⋮ Global optimization of robust truss topology via mixed integer semidefinite programming ⋮ Partitioning procedure for polynomial optimization ⋮ Estimating arrival rate of nonhomogeneous Poisson processes with semidefinite programming ⋮ Optimal transportation under controlled stochastic dynamics ⋮ Second-order cone programming formulations for a class of problems in structural optimization ⋮ Approximation algorithms for homogeneous polynomial optimization with quadratic constraints ⋮ Stochastic ellipsoid methods for robust control: Multiple updates and multiple cuts ⋮ Recent advances in mathematical programming with semi-continuous variables and cardinality constraint ⋮ Polynomial time solvability of non-symmetric semidefinite programming ⋮ Second-order cone programming with warm start for elastoplastic analysis with von Mises yield criterion ⋮ Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization ⋮ Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems ⋮ Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones ⋮ Nonlinear dimensionality reduction by topologically constrained isometric embedding ⋮ Lifting for conic mixed-integer programming ⋮ Convex optimization approach to a single quadratically constrained quadratic minimization problem ⋮ On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization ⋮ Full Nesterov-Todd step infeasible interior-point method for symmetric optimization ⋮ Market price-based convex risk measures: a distribution-free optimization approach ⋮ Computational Cam clay plasticity using second-order cone programming ⋮ Stochastic receding horizon control with output feedback and bounded controls ⋮ Analysis of microstructures and phase transition phenomena in one-dimensional, non-linear elasticity by convex optimization ⋮ New second-order cone linear complementarity formulation and semi-smooth Newton algorithm for finite element analysis of 3D frictional contact problem ⋮ On convex optimization without convex representation ⋮ A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation ⋮ The truncated moment problem via homogenization and flat extensions ⋮ A new semidefinite programming relaxation scheme for a class of quadratic matrix problems ⋮ Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria ⋮ Dual semidefinite programs without duality gaps for a class of convex minimax programs ⋮ A first order method for finding minimal norm-like solutions of convex optimization problems ⋮ Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization ⋮ RCMARS: robustification of CMARS with different scenarios under polyhedral uncertainty set ⋮ On the indefinite quadratic fractional optimization with two quadratic constraints ⋮ Free semidefinite representation of matrix power functions ⋮ On control of discrete-time state-dependent jump linear systems with probabilistic constraints: a receding horizon approach ⋮ Risk-control approach for bottleneck transportation problem with randomness and fuzziness ⋮ On deconvolution of distribution functions ⋮ A reduced complexity MIN-plus solution method to the optimal control of closed quantum systems ⋮ Convex optimization methods for dimension reduction and coefficient estimation in multivariate linear regression ⋮ First order conditions for semidefinite representations of convex sets defined by rational or singular polynomials ⋮ Cell design in bacteria as a convex optimization problem ⋮ The \(\mathcal A\)-truncated \(K\)-moment problem ⋮ Randomized methods based on new Monte Carlo schemes for control and optimization ⋮ Quadratic optimization over a second-order cone with linear equality constraints ⋮ Hypothesis testing by convex optimization ⋮ Generalized decision rule approximations for stochastic programming via liftings ⋮ Bound for the 2-page fixed linear crossing number of hypercube graph via SDP relaxation ⋮ Relative entropy optimization and its applications ⋮ Smooth strongly convex interpolation and exact worst-case performance of first-order methods ⋮ Gradient-free proximal methods with inexact oracle for convex stochastic nonsmooth optimization problems on the simplex ⋮ Semidefinite approximations of conical hulls of measured sets ⋮ Barycentric algorithm for computing D-optimal size- and cost-constrained designs of experiments ⋮ An axiomatic duality framework for the theta body and related convex corners ⋮ Linear conic formulations for two-party correlations and values of nonlocal games ⋮ Simple approximations of semialgebraic sets and their applications to control ⋮ Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization ⋮ Adaptive smoothing algorithms for nonsmooth composite convex minimization ⋮ A polynomial primal-dual affine scaling algorithm for symmetric conic optimization ⋮ Total variation reconstruction from quadratic measurements ⋮ Gain-loss based convex risk limits in discrete-time trading ⋮ Robust semidefinite programming problems with general nonlinear parameter dependence: approaches using the DC-representations ⋮ Randomized algorithm to determine the eigenvector of a stochastic matrix with application to the PageRank problem ⋮ A variational principle of elastoplasticity and its application to the modeling of frictional materials ⋮ A semidefinite programming study of the Elfving theorem ⋮ Robust linear optimization under general norms. ⋮ A conic quadratic formulation for a class of convex congestion functions in network flow problems ⋮ An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications ⋮ Introduction to convex optimization in financial markets ⋮ Quantum convex support ⋮ Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons ⋮ Minimax and Minimax Projection Designs Using Clustering ⋮ Smooth minimization of non-smooth functions ⋮ Conditional minimum volume ellipsoid with application to multiclass discrimination ⋮ A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization

This page was built for publication: Lectures on Modern Convex Optimization