A Newton-bracketing method for a simple conic optimization problem-Reference-Cited by-同舟云学术

A Newton-bracketing method for a simple conic optimization problem

Published:2020-07-01 Issue:2-3 Volume:36 Page:371-388
ISSN:1055-6788
Container-title:Optimization Methods and Software
language:en
Short-container-title:Optimization Methods and Software

Author:

Kim Sunyoung¹,Kojima Masakazu²,Toh Kim-Chuan³

Affiliation:

1. Department of Mathematics, Ewha Womans University, Seoul, Korea

2. Department of Industrial and Systems Engineering, Chuo University, Tokyo, Japan

3. Department of Mathematics, and Institute of Operations Research and Analytics, National University of Singapore, Singapore, Singapore

Funder

National Research Foundation of Korea - NRF

Grant-in-Aid for Scientific Research

Publisher

Informa UK Limited

Subject

Applied Mathematics,Control and Optimization,Software

Link

https://www.tandfonline.com/doi/pdf/10.1080/10556788.2020.1782906

Reference22 articles.

1. Handbook on Semidefinite, Conic and Polynomial Optimization

2. A robust Lagrangian-DNN method for a class of quadratic optimization problems

3. N. Arima, S. Kim, M. Kojima, and K.C. Toh, Lagrangian-conic relaxations, part II: Applications to polynomial optimization problems. To appear in Pac. J. Optim.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Robust crossings detection in noisy signals using topological signal processing;Foundations of Data Science;2024

2. Strong duality of a conic optimization problem with a single hyperplane and two cone constraints;Optimization;2023-08-28

3. Isotonicity of the proximity operator and stochastic optimization problems in Hilbert quasi-lattices endowed with Lorentz cones;Optimization Methods and Software;2022-04-25