Projection Methods in Conic Optimization
From MaRDI portal
Publication:2802538
DOI10.1007/978-1-4614-0769-0_20zbMath1334.90105arXiv1103.1511OpenAlexW1554493780MaRDI QIDQ2802538
Publication date: 26 April 2016
Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1103.1511
Semidefinite programming (90C22) Applications of mathematical programming (90C90) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Decomposition Methods for Sparse Matrix Nearness Problems, Gradient methods and conic least-squares problems, Closed-Form Expressions for Projectors onto Polyhedral Sets in Hilbert Spaces, A hierarchy of spectral relaxations for polynomial optimization, An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization, Reducing the projection onto the monotone extended second-order cone to the pool-adjacent-violators algorithm of isotonic regression, DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization, An extended projective formula and its application to semidefinite optimization, Infeasibility detection in the alternating direction method of multipliers for convex optimization, Mean squared error minimization for inverse moment problems, Estimation of multivariate generalized gamma convolutions through Laguerre expansions, A semidefinite programming approach for the projection onto the cone of negative semidefinite symmetric tensors with applications to solid mechanics
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing the nearest correlation matrix--a problem from finance
- Solving semidefinite-quadratic-linear programs using SDPT3
- Smooth minimization of non-smooth functions
- A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs
- Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
- Local linear convergence for alternating and averaged nonconvex projections
- Interest rate models -- theory and practice. With smile, inflation and credit
- A boundary point method to solve semidefinite programs
- Semidefinite programming relaxations for graph coloring and maximal clique problems
- On the solution of large-scale SDP problems by the modified barrier method using iterative solvers
- Solving Hankel matrix approximation problem using semidefinite programming
- Some numerical experiments with variable-storage quasi-Newton algorithms
- Tame functions are semismooth
- An inexact primal-dual path following algorithm for convex quadratic SDP
- Computing a nearest symmetric positive semidefinite matrix
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Convergence of some algorithms for convex minimization
- Complementarity and nondegeneracy in semidefinite programming
- A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs
- Optimal linear arrangements using betweenness variables
- Positive polynomials in control.
- A nonsmooth version of Newton's method
- Clarke generalized Jacobian of the projection onto the cone of positive semidefinite matrices
- An augmented Lagrangian dual approach for the H-weighted nearest correlation matrix problem
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- Projection methods for conic feasibility problems: applications to polynomial sum-of-squares decompositions
- A Sequential Semismooth Newton Method for the Nearest Low-rank Correlation Matrix Problem
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- An Algorithm for Restricted Least Squares Regression
- A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
- Calibrating Least Squares Semidefinite Programming with Equality and Inequality Constraints
- An Augmented Primal-Dual Method for Linear Conic Programs
- Optimization and nonsmooth analysis
- Smoothing and Interpolation in a Convex Subset of a Hilbert Space
- Inexact Newton Methods
- Monotone Operators and the Proximal Point Algorithm
- On the Shannon capacity of a graph
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Linear Matrix Inequalities in System and Control Theory
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- PENNON: A code for convex nonlinear and semidefinite programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- A Dual Approach to Semidefinite Least-Squares Problems
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Least-Squares Approximation of Structured Covariances
- A preconditioned Newton algorithm for the nearest correlation matrix
- Regularization Methods for Semidefinite Programming
- Alternating Projections on Manifolds
- Solving Lift-and-Project Relaxations of Binary Integer Programs
- A Sum of Squares Approximation of Nonnegative Polynomials
- Least-Squares Covariance Matrix Adjustment
- Semismooth Matrix-Valued Functions
- Positive trigonometric polynomials and signal processing applications
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Best approximation in inner product spaces
