Proximal alternating penalty algorithms for nonsmooth constrained convex optimization
Sign Up to like & getrecommendations! Published in 2019 at "Computational Optimization and Applications"
DOI: 10.1007/s10589-018-0033-z
Abstract: We develop two new proximal alternating penalty algorithms to solve a wide range class of constrained convex optimization problems. Our approach mainly relies on a novel combination of the classical quadratic penalty, alternating minimization, Nesterov’s… read more here.
Keywords: proximal alternating; alternating penalty; constrained convex; penalty ... See more keywords
An intermixed iteration for constrained convex minimization problem and split feasibility problem
Sign Up to like & getrecommendations! Published in 2019 at "Journal of Inequalities and Applications"
DOI: 10.1186/s13660-019-2222-4
Abstract: In this paper, we first introduce the two-step intermixed iteration for finding the common solution of a constrained convex minimization problem, and also we prove a strong convergence theorem for the intermixed algorithm. By using… read more here.
Keywords: intermixed iteration; minimization problem; split feasibility; convex minimization ... See more keywords
Tighter quadratically constrained convex reformulations for semi-continuous quadratic programming
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Industrial and Management Optimization"
DOI: 10.3934/jimo.2020071
Abstract: The paper proposes a novel class of quadratically constrained convex reformulations (QCCR) for semi-continuous quadratic programming. We first propose the class of QCCR for the studied problem. Next, we discuss how to polynomially find the… read more here.
Keywords: quadratically constrained; continuous quadratic; constrained convex; convex reformulations ... See more keywords