• Home
  • Search
  • Proximal Algorithms for Structured Nonconvex Optimization
  • Cite Icon6
  • https://doi.org/10.13140/rg.2.2.25521.04962Copy DOI Icon

Proximal Algorithms for Structured Nonconvex Optimization

  • Abstract
  • Literature Map
  • Citations
  • Similar Papers
Abstract

Due to their simplicity and versatility, splitting algorithms are often the methods of choice for many optimization problems arising in engineering. “Splitting” complex problems into simpler subtasks, their complexity scales well with problem size, making them particularly suitable for large-scale applications where other popular methods such as IP or SQP cannot be employed. There are, however, two major downsides: 1) there is no satisfactory theory in support of their employment for nonconvex problems, and 2) their efficacy is severely affected by ill conditioning. Many attempts have been made to overcome these issues, but only incomplete or case-specific theories have been established, and some enhancements have been proposed which however either fail to preserve the simplicity of the original algorithms, or can only offer local convergence guarantees. This thesis aims at overcoming these downsides. First, we provide novel tight convergence results for the popular DRS and ADMM schemes for nonconvex problems, through an elegant unified framework reminiscent of Lyapunov stability theory. “Proximal envelopes”, whose analysis is here extended to nonconvex problems, prove to be the suitable Lyapunov functions. Furthermore, based on these results we develop enhancements of splitting algorithms, the first that 1) preserve complexity and convergence properties, 2) are suitable for nonconvex problems, and 3) achieve asymptotic superlinear rates.

Similar Papers
  • 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
  • Citations43

A new fuzzy strategy for size and topology optimization of truss structures

  • May 18, 2020
  • Applied Soft Computing
  • Ali Mortazavi
  • Research Article
  • Citations360

Non-convex Optimization for Machine Learning

  • Dec 04, 2017
  • Foundations and Trends® in Machine Learning
  • Prateek Jain +1
  • Research Article
  • Citations24

Generalized gradient projection neural networks for nonsmooth optimization problems

  • May 01, 2010
  • Science China Information Sciences
  • Guocheng Li +2
  • Research Article
  • Citations12

Douglas–Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms

  • May 11, 2022
  • Computational Optimization and Applications
  • Andreas Themelis +2
  • Research Article
  • Citations34

Faster First-Order Methods for Stochastic Non-Convex Optimization on Riemannian Manifolds.

  • Aug 08, 2019
  • IEEE Transactions on Pattern Analysis and Machine Intelligence
  • Pan Zhou +3
  • Research Article
  • Citations31

Sizing and shape optimization of truss employing a hybrid constraint-handling technique and manta ray foraging optimization

  • Oct 12, 2022
  • Expert Systems with Applications
  • Hongyou Cao +4
  • Research Article
  • Citations1

Riemannian stochastic fixed point optimization algorithm

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

A modified BFGS method and its superlinear convergence in nonconvex minimization with general line search rule

  • Jul 05, 2008
  • Journal of Applied Mathematics and Computing
  • Qiang Guo +2
  • Research Article
  • Citations2

Accelerated analysis on the triple momentum method for a two-layer ReLU neural network

  • Mar 28, 2024
  • Journal of King Saud University - Computer and Information Sciences
  • Xin Liu +1
  • Research Article
  • Citations1

A Hybrid Algorithm for Practical Nonconvex Optimization

  • Jan 01, 2021
  • IFAC-PapersOnLine
  • Dawn M Hustig-Schultz +1
  • Conference Article
  • Citations7

Ananya Algorithm: A Simple and New Optimization Algorithm for Engineering Optimization

  • Jan 15, 2021
  • Neeraj Agarwal +2
  • Research Article
  • Citations3

Block coordinate descentwith time perturbation for nonconvex nonsmooth problems in real-world studies

  • Oct 01, 2019
  • Frontiers of Information Technology & Electronic Engineering
  • Rui Liu +4
  • Research Article
  • Citations2

An Enhanced Team-Oriented Swarm Optimization Algorithm (ETOSO) for Robust and Efficient High-Dimensional Search.

  • Apr 03, 2025
  • Biomimetics (Basel, Switzerland)
  • Adel Benabdennour
  • Research Article
  • Citations48

Structural optimization employing isogeometric tools in Particle Swarm Optimizer

  • Apr 05, 2019
  • Journal of Building Engineering
  • Ioannis N Tsiptsis +3
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.