Introductory lectures on convex optimization. A basic course.
From MaRDI portal
Publication:1417731
zbMath1086.90045MaRDI QIDQ1417731
Publication date: 5 January 2004
Published in: Applied Optimization (Search for Journal in Brave)
90C25: Convex programming
90-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming
Related Items
Towards non-symmetric conic optimization, Rounding of convex sets and efficient gradient methods for linear programming problems, Primal-dual subgradient methods for convex problems, Global complexity bound analysis of the Levenberg-Marquardt method for nonsmooth equations and its application to the nonlinear complementarity problem, Approximate level method for nonsmooth convex minimization, An optimal method for stochastic composite optimization, An implementable proximal point algorithmic framework for nuclear norm minimization, Lipschitz gradients for global optimization in a one-point-based partitioning scheme, Implementation of an optimal first-order method for strongly convex total variation regularization, Interior point methods 25 years later, About the Lipschitz property of the metric projection in the Hilbert space, Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results, Approximation accuracy, gradient methods, and error bound for structured convex optimization, Existence, uniqueness, and convergence of the regularized primal-dual central path, The CoMirror algorithm for solving nonsmooth constrained convex problems, Analysis of stochastic dual dynamic programming method, On a global complexity bound of the Levenberg-marquardt method, Phase transitions for greedy sparse approximation algorithms, Testing the nullspace property using semidefinite programming, Barrier subgradient method, Quadratic regularizations in an interior-point method for primal block-angular problems, Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity, Complexity bounds for second-order optimality in unconstrained optimization, Cell design in bacteria as a convex optimization problem, Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes, Introduction to convex optimization in financial markets, Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder), A heuristic for optimizing stochastic activity networks with applications to statistical digital circuit sizing, Convex duality and calculus: Reduction to cones, On total variation minimization and surface evolution using parametric maximum flows, Algorithms and software for total variation image reconstruction via first-order methods, Dual extrapolation and its applications to solving variational inequalities and related problems, Newton's method and its use in optimization, Smoothing technique and its applications in semidefinite optimization, A gradient-type algorithm optimizing the coupling between matrices, Parabolic target space and primal-dual interior-point methods, Some first-order algorithms for total variation based image restoration, Accelerating the cubic regularization of Newton's method on convex problems, ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems, Primal central paths and Riemannian distances for convex sets, Support vector machine classification with indefinite kernels, Maximization of the Choquet integral over a convex set and its application to resource allocation problems, Templates for convex cone problems with applications to sparse signal recovery, The convex geometry of linear inverse problems, A first-order primal-dual algorithm for convex problems with applications to imaging, Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems, An improved ellipsoid method for solving convex differentiable optimization problems, Accelerated linearized Bregman method, A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems, Linear convergence analysis of the use of gradient projection methods on total variation problems, Separable self-concordant spectral functions and a conjecture of Tunçel, Self-concordant functions for optimization on smooth manifolds, Cubic regularization of Newton method and its global performance, Gradient methods for nonstationary unconstrained optimization problems, Nonlinear regularization techniques for seismic tomography, Improving an interior-point algorithm for multicommodity flows by quadratic regularizations, Polynomial-time interior-point algorithm based on a local self-concordant finite barrier function, An Algorithm for Unconstrained Quadratically Penalized Convex Optimization, Resource allocation in an asymmetric technology race with temporary advantages, Interior-point methods for optimization
