Gradient methods and conic least-squares problems
DOI10.1080/10556788.2014.990452zbMath1328.90109OpenAlexW2057348994MaRDI QIDQ3458817
Publication date: 28 December 2015
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2014.990452
fast gradient methodsLagrange dualsemidefinite least-squares problemconic convex quadratic programconic least-squares problemNesterov's excessive gap techniqueNesterov's smoothing algorithm
Semidefinite programming (90C22) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Quadratic programming (90C20) Interior-point methods (90C51)
Related Items (1)
Uses Software
Cites Work
- Computing the nearest correlation matrix--a problem from finance
- Smooth minimization of non-smooth functions
- Primal-dual interior-point algorithm for convex quadratic semi-definite optimization
- An inexact primal-dual path following algorithm for convex quadratic SDP
- Generalizations of Slater's constraint qualification for infinite convex programs
- Positive definite constrained least-squares estimation of matrices
- Least-squares solution of \(F=PG\) over positive semidefinite symmetric \(P\)
- A Newton's method for perturbed second-order cone programs
- Projection Methods in Conic Optimization
- On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0
- An augmented Lagrangian dual approach for the H-weighted nearest correlation matrix problem
- Semi-Infinite Programming: Theory, Methods, and Applications
- A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming
- A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
- Calibrating Least Squares Semidefinite Programming with Equality and Inequality Constraints
- A simple constraint qualification in infinite dimensional programming
- A comparison of constraint qualifications in infinite-dimensional convex programming revisited
- A Dual Approach to Semidefinite Least-Squares Problems
- A Predictor-Corrector Interior-Point Algorithm for the Semidefinite Linear Complementarity Problem Using the Alizadeh--Haeberly--Overton Search Direction
- Semidefinite Programming: A Path-Following Algorithm for a Linear–Quadratic Functional
- Excessive Gap Technique in Nonsmooth Convex Minimization
- Least-Squares Covariance Matrix Adjustment
- A predictor--corrector algorithm for QSDP combining Dikin-type and Newton centering steps
This page was built for publication: Gradient methods and conic least-squares problems
