• Home
  • Search
  • On Algorithms for Nonconvex Optimization in the Calculus of Variations
  • Cite Icon11
  • https://doi.org/10.1137/0732042Copy DOI Icon

On Algorithms for Nonconvex Optimization in the Calculus of Variations

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

A simple algorithm for the computation of local minima of nonconvex problems in one dimension is proposed. This algorithm avoids certain well-known local minima that are distant from the global minimum and can be used to improve the minima obtained using classical descent methods. The calculated minima have mesh scale oscillations typical of weakly converging sequences. It is shown that these local minima converge weakly to the correct limit for certain simple problems; however, numerical evidence suggests that the gradients may not converge to the correct weak limits, and this is verified using asymptotic expansions. Extensions to multiple dimensions and some numerical examples in two dimensions are considered.

Similar Papers
  • Research Article
  • Citations184

A new gradient based particle swarm optimization algorithm for accurate computation of global minimum

  • Sep 01, 2011
  • Applied Soft Computing
  • Mathew M Noel
  • Research Article

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

  • Jan 01, 2025
  • International Mathematical Forum
  • Mahmoud El-Hashash
  • PDF
  • Research Article
  • Citations1

NUMERICAL STUDY OF THE PARAMETRIC OPTIMIZATION OF THE FORCED FREQUENCY OF OSCILLATIONS OF THE MINIMUM SURFACE SHELL ON THE SQUARE CONTOUR UNDER THERMAL LOAD

  • Jun 27, 2022
  • APPLIED GEOMETRY AND ENGINEERING GRAPHICS
  • Hryhorii Ivanchenko +1
  • Research Article
  • Citations1

Riemannian stochastic fixed point optimization algorithm

  • Feb 08, 2022
  • Numerical Algorithms
  • Hideaki Iiduka +1
  • Conference Article
  • Citations15

Stochastic Motion Planning Using Successive Convexification and Probabilistic Occupancy Functions

  • Dec 01, 2018
  • Abraham P Vinod +4
  • Research Article
  • Citations1

A Hybrid Algorithm for Practical Nonconvex Optimization

  • Jan 01, 2021
  • IFAC-PapersOnLine
  • Dawn M Hustig-Schultz +1
  • Research Article
  • Citations90

Quasi-Newton methods for solving multiobjective optimization

  • Jul 30, 2011
  • Operations Research Letters
  • Shaojian Qu +2
  • Research Article
  • Citations32

English

  • Mar 06, 2017
  • APPLICATIONS OF MATHEMATICS
  • Roman Knobloch +2
  • Research Article
  • Citations7

Nonconvex optimization-based inverse spectral decomposition

  • Jul 26, 2019
  • Journal of Geophysics and Engineering
  • Ming Ma +4
  • Research Article
  • Citations41

Fast and Guaranteed Blind Multichannel Deconvolution Under a Bilinear System Model

  • Jul 01, 2018
  • IEEE Transactions on Information Theory
  • Kiryung Lee +2
  • Conference Article
  • Citations3

Method for finding a global minimum

  • Aug 22, 1994
  • 5th Symposium on Multidisciplinary Analysis and Optimization
  • A Bolonkin +1
  • PDF
  • Research Article
  • Citations21

Data Clustering Method Based on Improved Bat Algorithm With Six Convergence Factors and Local Search Operators

  • Jan 01, 2020
  • IEEE Access
  • L F Zhu +5
  • Supplementary Content
  • Citations6

Proximal Algorithms for Structured Nonconvex Optimization

  • Jan 01, 2018
  • Kyushu University Institutional Repository (QIR) (Kyushu University)
  • Andreas Themelis
  • 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
  • PDF
  • Research Article

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

  • Oct 27, 2021
  • Journal of Global Optimization
  • Takahito Kuno
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.