@InProceedings{7362679,
  author = {Y. Yang and M. Pesavento},
  booktitle = {2015 23rd European Signal Processing Conference (EUSIPCO)},
  title = {A novel line search method for nonsmooth optimization problems},
  year = {2015},
  pages = {1726-1730},
  abstract = {In this paper, we propose a novel exact/successive line search method for stepsize calculation in iterative algorithms for nonsmooth optimization problems. The proposed approach is to perform line search over a properly constructed differ-entiable function based on the original nonsmooth objective function, and it outperforms state-of-the-art techniques from the perspective of convergence speed, computational complexity and signaling burden. When applied to LASSO, the proposed exact line search is shown, either analytically or numerically, to exhibit several desirable advantages, namely: it is implementable in closed-form, converges fast and is robust with respect to the choice of problem parameters.},
  keywords = {computational complexity;iterative methods;optimisation;signal processing;nonsmooth optimization problems;exact-successive line search method;stepsize calculation;iterative algorithms;differ-entiable function;original nonsmooth objective function;convergence speed;computational complexity;signaling burden;LASSO;Convergence;Search problems;Linear programming;Approximation methods;Europe;Iterative methods;Descent Direction Method;Distributed and Parallel Algorithms;LASSO;Line Search;Nondifferentiable Optimization;Successive Convex Approximation},
  doi = {10.1109/EUSIPCO.2015.7362679},
  issn = {2076-1465},
  month = {Aug},
  url = {https://www.eurasip.org/proceedings/eusipco/eusipco2015/papers/1570096865.pdf},
}

{"_id":"Wp792RFgPEmrcRKWL","bibbaseid":"yang-pesavento-anovellinesearchmethodfornonsmoothoptimizationproblems-2015","authorIDs":[],"author_short":["Yang, Y.","Pesavento, M."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Y."],"propositions":[],"lastnames":["Yang"],"suffixes":[]},{"firstnames":["M."],"propositions":[],"lastnames":["Pesavento"],"suffixes":[]}],"booktitle":"2015 23rd European Signal Processing Conference (EUSIPCO)","title":"A novel line search method for nonsmooth optimization problems","year":"2015","pages":"1726-1730","abstract":"In this paper, we propose a novel exact/successive line search method for stepsize calculation in iterative algorithms for nonsmooth optimization problems. The proposed approach is to perform line search over a properly constructed differ-entiable function based on the original nonsmooth objective function, and it outperforms state-of-the-art techniques from the perspective of convergence speed, computational complexity and signaling burden. When applied to LASSO, the proposed exact line search is shown, either analytically or numerically, to exhibit several desirable advantages, namely: it is implementable in closed-form, converges fast and is robust with respect to the choice of problem parameters.","keywords":"computational complexity;iterative methods;optimisation;signal processing;nonsmooth optimization problems;exact-successive line search method;stepsize calculation;iterative algorithms;differ-entiable function;original nonsmooth objective function;convergence speed;computational complexity;signaling burden;LASSO;Convergence;Search problems;Linear programming;Approximation methods;Europe;Iterative methods;Descent Direction Method;Distributed and Parallel Algorithms;LASSO;Line Search;Nondifferentiable Optimization;Successive Convex Approximation","doi":"10.1109/EUSIPCO.2015.7362679","issn":"2076-1465","month":"Aug","url":"https://www.eurasip.org/proceedings/eusipco/eusipco2015/papers/1570096865.pdf","bibtex":"@InProceedings{7362679,\n author = {Y. Yang and M. Pesavento},\n booktitle = {2015 23rd European Signal Processing Conference (EUSIPCO)},\n title = {A novel line search method for nonsmooth optimization problems},\n year = {2015},\n pages = {1726-1730},\n abstract = {In this paper, we propose a novel exact/successive line search method for stepsize calculation in iterative algorithms for nonsmooth optimization problems. The proposed approach is to perform line search over a properly constructed differ-entiable function based on the original nonsmooth objective function, and it outperforms state-of-the-art techniques from the perspective of convergence speed, computational complexity and signaling burden. When applied to LASSO, the proposed exact line search is shown, either analytically or numerically, to exhibit several desirable advantages, namely: it is implementable in closed-form, converges fast and is robust with respect to the choice of problem parameters.},\n keywords = {computational complexity;iterative methods;optimisation;signal processing;nonsmooth optimization problems;exact-successive line search method;stepsize calculation;iterative algorithms;differ-entiable function;original nonsmooth objective function;convergence speed;computational complexity;signaling burden;LASSO;Convergence;Search problems;Linear programming;Approximation methods;Europe;Iterative methods;Descent Direction Method;Distributed and Parallel Algorithms;LASSO;Line Search;Nondifferentiable Optimization;Successive Convex Approximation},\n doi = {10.1109/EUSIPCO.2015.7362679},\n issn = {2076-1465},\n month = {Aug},\n url = {https://www.eurasip.org/proceedings/eusipco/eusipco2015/papers/1570096865.pdf},\n}\n\n","author_short":["Yang, Y.","Pesavento, M."],"key":"7362679","id":"7362679","bibbaseid":"yang-pesavento-anovellinesearchmethodfornonsmoothoptimizationproblems-2015","role":"author","urls":{"Paper":"https://www.eurasip.org/proceedings/eusipco/eusipco2015/papers/1570096865.pdf"},"keyword":["computational complexity;iterative methods;optimisation;signal processing;nonsmooth optimization problems;exact-successive line search method;stepsize calculation;iterative algorithms;differ-entiable function;original nonsmooth objective function;convergence speed;computational complexity;signaling burden;LASSO;Convergence;Search problems;Linear programming;Approximation methods;Europe;Iterative methods;Descent Direction Method;Distributed and Parallel Algorithms;LASSO;Line Search;Nondifferentiable Optimization;Successive Convex Approximation"],"metadata":{"authorlinks":{}},"downloads":0},"bibtype":"inproceedings","biburl":"https://raw.githubusercontent.com/Roznn/EUSIPCO/main/eusipco2015url.bib","creationDate":"2021-02-13T17:31:52.472Z","downloads":0,"keywords":["computational complexity;iterative methods;optimisation;signal processing;nonsmooth optimization problems;exact-successive line search method;stepsize calculation;iterative algorithms;differ-entiable function;original nonsmooth objective function;convergence speed;computational complexity;signaling burden;lasso;convergence;search problems;linear programming;approximation methods;europe;iterative methods;descent direction method;distributed and parallel algorithms;lasso;line search;nondifferentiable optimization;successive convex approximation"],"search_terms":["novel","line","search","method","nonsmooth","optimization","problems","yang","pesavento"],"title":"A novel line search method for nonsmooth optimization problems","year":2015,"dataSources":["eov4vbT6mnAiTpKji","knrZsDjSNHWtA9WNT"]}