• Home
  • Search
  • A revision of the rectangular algorithm for a class of DC optimization problems
  • https://doi.org/10.1007/s10898-021-01102-2Copy DOI Icon

A revision of the rectangular algorithm for a class of DC optimization problems

Show More
  • Abstract
  • Highlights & Summary
  • PDF
  • Literature Map
  • References
  • Similar Papers
Abstract

Every continuously differentiable function can be represented as a difference between a convex function and an additively separable convex function. We show that a DC function with this structure can be optimized using the rectangular algorithm for separable nonconvex optimization, and develop a revision to this algorithm for practical use. We also report some numerical results which indicate the effectiveness of the revision.

Loading PDF

Similar Papers
  • Research Article
  • Citations1

Riemannian stochastic fixed point optimization algorithm

  • Feb 08, 2022
  • Numerical Algorithms
  • Hideaki Iiduka +1
  • PDF
  • Research Article
  • Citations6

A General-Purpose Multi-Dimensional Convex Landscape Generator

  • Oct 26, 2022
  • Mathematics
  • Wenwen Liu +3
  • Research Article
  • Citations4

Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints

  • Oct 01, 2009
  • Journal of Interdisciplinary Mathematics
  • Stefan M Stefanov
  • Research Article
  • Citations15

An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels

  • Jun 06, 2018
  • Optimization
  • J X Cruz Neto +3
  • Conference Article
  • Citations16

Distributed algorithms for convex network optimization under non-sparse equality constraints

  • Sep 01, 2016
  • Ashish Cherukuri +1
  • Research Article
  • Citations1

Smoothing algorithms for nonsmooth optimization over the Stiefel manifold with applications to the graph Fourier basis problem

  • Mar 09, 2024
  • Analysis and Applications
  • Jinlai Zhu +3
  • Research Article
  • Citations18

An algorithm for bounded-error identification of nonlinear systems based on DC functions

  • Nov 26, 2007
  • Automatica
  • J.M Bravo +3
  • Research Article
  • Citations7

Algorithms for sparse and low-rank optimization: convergence, complexity and applications

  • Jan 01, 2011
  • Columbia Academic Commons (Columbia University)
  • Donald Goldfarb +1
  • Research Article
  • Citations11

On Algorithms for Nonconvex Optimization in the Calculus of Variations

  • Jun 01, 1995
  • SIAM Journal on Numerical Analysis
  • Ling Ma +1
  • Research Article
  • Citations142

IPiasco: Inertial Proximal Algorithm for Strongly Convex Optimization

  • Feb 19, 2015
  • Journal of Mathematical Imaging and Vision
  • Peter Ochs +2
  • Conference Article
  • Citations231

Finding approximate local minima faster than gradient descent

  • Jun 19, 2017
  • Naman Agarwal +4
  • Research Article

Proximal iterative Gaussian smoothing algorithm for a class of nonsmooth convex minimization problems

  • Jan 01, 2015
  • Numerical Algebra, Control & Optimization
  • Sanming Liu +2
  • PDF
  • Research Article
  • Citations1

The Extension of Auxiliary Problem Principle for Solving Dynamic Economic Dispatch Problem in Power Systems

  • Jan 01, 2022
  • Journal of Mathematics
  • Yaming Ren
  • Research Article
  • Citations4

Synchronous Parallel Block Coordinate Descent Method for Nonsmooth Convex Function Minimization

  • Apr 01, 2020
  • Journal of Systems Science and Complexity
  • Yutong Dai +1
  • Research Article

Hybrid optimization: combining global and local search algorithms for efficient non-convex optimization

  • Jan 01, 2025
  • International Mathematical Forum
  • Mahmoud El-Hashash
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.