Gradient methods and conic least-squares problems

DOI10.1080/10556788.2014.990452MaRDI QIDQ3458817zbMATH OpenOpenAlexFDO

Authors Yu Xia

Publication date 28 December 2015

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556788.2014.990452

zbMATH Keywords

fast gradient methodsLagrange dualsemidefinite least-squares problemconic convex quadratic programconic least-squares problemNesterov's excessive gap techniqueNesterov's smoothing algorithm

Mathematics Subject Classification ID

Quadratic programming (90C20) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Interior-point methods (90C51) Semidefinite programming (90C22)

Recommendations

• scientific article; zbMATH DE number 4009671
• scientific article; zbMATH DE number 3956828
• scientific article; zbMATH DE number 992790
• Interior Gradient and Proximal Methods for Convex and Conic Optimization
• scientific article; zbMATH DE number 4043617
• scientific article; zbMATH DE number 4074370
• Gradient methods for large scale convex quadratic functions
• A generalized conjugate gradient, least square method
• scientific article; zbMATH DE number 3304573
• scientific article; zbMATH DE number 773161

Cites work

• A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming
• A Dual Approach to Semidefinite Least-Squares Problems
• A Newton's method for perturbed second-order cone programs
• A Predictor-Corrector Interior-Point Algorithm for the Semidefinite Linear Complementarity Problem Using the Alizadeh--Haeberly--Overton Search Direction
• A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
• A comparison of constraint qualifications in infinite-dimensional convex programming revisited
• A predictor--corrector algorithm for QSDP combining Dikin-type and Newton centering steps
• A simple constraint qualification in infinite dimensional programming
• An augmented Lagrangian dual approach for the H-weighted nearest correlation matrix problem
• An inexact primal-dual path following algorithm for convex quadratic SDP
• Calibrating Least Squares Semidefinite Programming with Equality and Inequality Constraints
• Computing the nearest correlation matrix--a problem from finance
• Excessive Gap Technique in Nonsmooth Convex Minimization
• Generalizations of Slater's constraint qualification for infinite convex programs
• Least-Squares Covariance Matrix Adjustment
• Least-squares solution of \(F=PG\) over positive semidefinite symmetric \(P\)
• On the implementation and usage of SDPT3 -- a Matlab software package for semidefinite-quadratic-linear programming, version 4.0
• Positive definite constrained least-squares estimation of matrices
• Primal-dual interior-point algorithm for convex quadratic semi-definite optimization
• Projection Methods in Conic Optimization
• Semi-Infinite Programming: Theory, Methods, and Applications
• Semidefinite Programming: A Path-Following Algorithm for a Linear–Quadratic Functional
• Smooth minimization of non-smooth functions

Cited in

(7)

• Interior-point gradient method for large-scale totally nonnegative least squares problems
• The planar least gradient problem in convex domains, the case of continuous datum
• Solution refinement at regular points of conic problems
• scientific article; zbMATH DE number 2164713 (Why is no real title available?)
• Linear regression models, least-squares problems, normal equations, and stopping criteria for the conjugate gradient method
• A subgradient method for free material design
• The Constrained Least Gradient Problem in R n

Describes a project that uses

Uses Software

• YALMIP
• SeDuMi

This page was built for publication: Gradient methods and conic least-squares problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3458817)