A first order method for finding minimal norm-like solutions of convex optimization problems
- 30 August 2013
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 147 (1-2) , 25-46
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Exact Regularization of Convex ProgramsSIAM Journal on Optimization, 2008
- Bilevel programming: A survey4OR, 2005
- On the Minimum Norm Solution of Linear ProgramsJournal of Optimization Theory and Applications, 2003
- Lectures on Modern Convex Optimization2001
- REGULARIZATION TOOLS: A Matlab package for analysis and solution of discrete ill-posed problemsNumerical Algorithms, 1994
- The Use of the L-Curve in the Regularization of Discrete Ill-Posed ProblemsSIAM Journal on Scientific Computing, 1993
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman FunctionsSIAM Journal on Optimization, 1993
- Finite perturbation of convex programsApplied Mathematics & Optimization, 1991
- Optimality in convex programming: A feasible directions approach1982
- Generalized Cross-Validation as a Method for Choosing a Good Ridge ParameterTechnometrics, 1979