The Validity of a Family of Optimization Methods

DOI10.1137/0308003zbMATH Open0194.20501OpenAlexW2044609813MaRDI QIDQ5589754FDOQ5589754

Authors:

Publication date: 1970

Published in: SIAM Journal on Control (Search for Journal in Brave)

Full work available at URL: http://digital.library.wisc.edu/1793/57508

zbMATH Keywords

operations research

Cited In (51)

• Title not available (Why is that?)
• On functions whose stationary points are global minima
• A robust lot sizing problem with ill-known demands
• An algorithm for optimizing network flow capacity under economies of scale
• Characterization of local solutions for a class of nonconvex programs
• On local search in d.c. optimization problems
• Solution of certain nonlinear programs involving r-convex functions
• Stability theorems for infinitely constrained mathematical programs
• The positiveness of lower limits of the Hoffman constant in parametric polyhedral programs
• Marginal values in mixed integer linear programming
• Convergence properties of local solutions of sequences of mathematical programming problems in general spaces
• Variations and extension of the convex-concave procedure
• Implementation of gradient methods by tangential discretization
• Sufficient conditions for the convergence of monotonic mathematical programming algorithms
• Paramétrisation et approximation d'un problème non convexe ; application à un problème de gestion de portefeuille
• Global convergence for Newton methods in mathematical programming
• A convergence theorem of Rosen’s gradient projection method
• Discussion on the convergence of Rosen's gradient projection method
• Remarks on the convergence of Rosen's gradient projection method
• Partitioning procedure for polynomial optimization
• Global optimization for special reverse convex programming
• Some comments on Russell graph efficiency measures in data envelopment analysis: the multiplicative approach
• Global convergence of Rosen's gradient projection method
• Title not available (Why is that?)
• Reverse convex problems: an approach based on optimality conditions
• Reverse convex programming
• A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron
• The Discrete Moment Problem with Nonconvex Shape Constraints
• On the global minimization of a convex function under general nonconvex constraints
• Convex programs with an additional reverse convex constraint
• Convex MPC for exclusion constraints
• A level set algorithm for a class of reverse convex programs
• Generalized Benders decomposition
• A review of the parameter estimation problem of fitting positive exponential sums to empirical data
• A note on functions whose local minima are global
• Safe polyhedral tubes for locally convexified MPC
• Linear programs with an additional reverse convex constraint
• Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
• Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems
• A nonisolated optimal solution for special reverse convex programming problems
• Primal-relaxed dual global optimization approach
• Optimization algorithms and point-to-set-maps
• Applications of a general convergence theory for outer approximation algorithms
• On functions whose local minima are global
• On the use of cuts in reverse convex programs
• Algorithm model for penalty functions-type iterative pcedures
• A systematic approach to the synthesis of algorithms
• Fault tolerant time optimization for a class of time-varying switched infinite dimensional linear systems
• A convergence theory for a class of anti-jamming strategies
• A finite cutting plane method for solving linear programs with an additional reverse convex constraint
• Sensitivity analysis for nonlinear programming using penalty methods

This page was built for publication: The Validity of a Family of Optimization Methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5589754)