Pages that link to "Item:Q5589754"

The following pages link to The Validity of a Family of Optimization Methods (Q5589754):

Displaying 50 items.

• On local search in d.c. optimization problems (Q299416) (← links)
• Remarks on the convergence of Rosen's gradient projection method (Q578857) (← links)
• Discussion on the convergence of Rosen's gradient projection method (Q578858) (← links)
• Partitioning procedure for polynomial optimization (Q604960) (← links)
• A robust lot sizing problem with ill-known demands (Q690887) (← links)
• The positiveness of lower limits of the Hoffman constant in parametric polyhedral programs (Q695340) (← links)
• A level set algorithm for a class of reverse convex programs (Q751513) (← links)
• Reverse convex problems: an approach based on optimality conditions (Q868408) (← links)
• A finite cutting plane method for solving linear programs with an additional reverse convex constraint (Q910336) (← links)
• On the use of cuts in reverse convex programs (Q913668) (← links)
• Global optimization for special reverse convex programming (Q931747) (← links)
• Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems (Q987509) (← links)
• Convex programs with an additional reverse convex constraint (Q1071651) (← links)
• On the global minimization of a convex function under general nonconvex constraints (Q1111474) (← links)
• Marginal values in mixed integer linear programming (Q1119179) (← links)
• Linear programs with an additional reverse convex constraint (Q1140531) (← links)
• Reverse convex programming (Q1147072) (← links)
• Stability theorems for infinitely constrained mathematical programs (Q1211417) (← links)
• Algorithm model for penalty functions-type iterative pcedures (Q1214742) (← links)
• A systematic approach to the synthesis of algorithms (Q1224412) (← links)
• A convergence theory for a class of anti-jamming strategies (Q1228553) (← links)
• Sufficient conditions for the convergence of monotonic mathematical programming algorithms (Q1230497) (← links)
• On functions whose stationary points are global minima (Q1231294) (← links)
• Implementation of gradient methods by tangential discretization (Q1250684) (← links)
• Primal-relaxed dual global optimization approach (Q1321372) (← links)
• Global convergence of Rosen's gradient projection method (Q1825143) (← links)
• An algorithm for optimizing network flow capacity under economies of scale (Q1843381) (← links)
• Characterization of local solutions for a class of nonconvex programs (Q1843382) (← links)
• On functions whose local minima are global (Q1843963) (← links)
• A review of the parameter estimation problem of fitting positive exponential sums to empirical data (Q1855142) (← links)
• Fault tolerant time optimization for a class of time-varying switched infinite dimensional linear systems (Q2086986) (← links)
• Some comments on Russell graph efficiency measures in data envelopment analysis: the multiplicative approach (Q2106765) (← links)
• Variations and extension of the convex-concave procedure (Q2358020) (← links)
• A nonisolated optimal solution for special reverse convex programming problems (Q2519714) (← links)
• Generalized Benders decomposition (Q2550358) (← links)
• Solution of certain nonlinear programs involving r-convex functions (Q2553386) (← links)
• Global convergence for Newton methods in mathematical programming (Q2556202) (← links)
• Convergence properties of local solutions of sequences of mathematical programming problems in general spaces (Q2558831) (← links)
• Convex MPC for exclusion constraints (Q2664230) (← links)
• Safe polyhedral tubes for locally convexified MPC (Q2665643) (← links)
• A convergence theorem of Rosen’s gradient projection method (Q3030593) (← links)
• Paramétrisation et approximation d'un problème non convexe ; application à un problème de gestion de portefeuille (Q3666608) (← links)
• (Q3730359) (← links)
• Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms (Q4047415) (← links)
• Optimization algorithms and point-to-set-maps (Q4070640) (← links)
• Sensitivity analysis for nonlinear programming using penalty methods (Q4133431) (← links)
• A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron (Q4136974) (← links)
• Applications of a general convergence theory for outer approximation algorithms (Q4770226) (← links)
• The Discrete Moment Problem with Nonconvex Shape Constraints (Q4994156) (← links)
• (Q5228577) (← links)