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