Convergence Conditions for Nonlinear Programming Algorithms

Cited in

(only showing first 100 items - show all)

A heuristic algorithm for network equilibration
A Tikhonov regularized penalty function approach for solving polylinear programming problems
Nonsmooth semi-infinite programming problems with mixed constraints
Necessary and sufficient conditions for convergence of iteration algorithms of nonlinear programming
A decision process over variables and their number: Two-phase optimality conditions
Applications of a general convergence theory for outer approximation algorithms
A new approach to stochastic programming problems: Discrete model
On subsidiary problems in geometric programming
Fixed Points and Stationary Points of Dissipative Multivalued Maps
Minimax estimation for singular linear multivariate models with mixed uncertainty
Eigenvector saddlepoints and zero properties of the eigenpolynomial factors
A review of techniques for automated structural design
An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality
The restricted EM algorithm under inequality restrictions on the parameters
Algorithm model for penalty functions-type iterative pcedures
A dual formulation for generating information about constrained optima in automated design
A generalization of Lagrange's method of undetermined multipliers using zero-zone functionals
A canonical structure for iterative procedures
Inelastic analysis of suspension structures by nonlinear programming
Finite sample moments results for the quasi-FIML estimator of the reduced form: The linear case
Alternating projections on nontangential manifolds
Nonnegative matrix factorization and I-divergence alternating minimization
Linear Chebyshev Approximation of Complex-Valued Functions
Extensions of Radstrom's lemma with application to stability theory of mathematical programming
Continuousization of the family of point-to-set maps and its applications
Local convergence of the fuzzy c-means algorithms
A unified approach to the feasible direction methods for nonlinear programming with linear constraints
Explicit duality for convex homogeneous programs
Heuristische Lösungsverfahren Versuch einer Begriffsklärung
Low-dose-rate extrapolation of data from animal carcinogenicity experiments. - Analysis of a new statistical technique
Trader-commodity parity theorems
Maximization of linearly constrained posynomials
A conversation with Jeff Wu
Large-scale problem analysis and decomposition theory
Nonlinear programming with cumulatively bounded variables
Combinatorial behavior of extreme points of perturbed polyhedra
Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
A general algorithm for obtaining simple structure of core arrays in \(N\)-way PCA with application to fluorometric data
A unified description of iterative algorithms for traffic equilibria
Nonparametric estimation and consistency for renewal processes
Canonical bases in linear programming
Optimal cargo allocation on board a plane: A sequential linear programming approach
stochastic quasigradient methods and their application to system optimization^†
Distributed asynchronous computation of fixed points
Some remarks on condensation methods for geometric programs
An exact penalty function algorithm for solving general constrained parameter optimization problems
The Topkis-Veinott algorithm for solving nonlinear programs with lower and upper bounded variables
Convergence of relaxation algorithms by averaging
Penalty function methods and a duality gap for invex optimization problems
A nontangential cutting plane algorithm
Some notes on the time-variant Lyapunov theory
Fractional programming
Biconvex sets and optimization with biconvex functions: a survey and extensions
Generalized second-order derivatives and optimality conditions
Interval Newton methods and perturbed problems
Modified descent methods for solving the monotone variational inequality problem
An algorithm for linearly constrained programs with a partly linear objective function
Sufficient conditions for the convergence of monotonic mathematical programming algorithms
A constrained optimization approach to solving certain systems of convex equations
Implied constraints and a unified theory of duality in linear and nonlinear programming
Global and variable cost manufacturing systems
The application of generalized Benders decomposition to certain nonconcave programs
Stochastic approximation of constrained systems with system and constraint noise
A geometric approach of gradient descent algorithms in linear neural networks
An algorithm for Ramsey pricing by multiproduct public firms under incomplete information
Using weighting vectors to solve multiple attribute problems: A framework
Lagrangian dual ascent by generalized linear programming
Numerical computational methods of optimisation in control
Lagrangian duality for preinvex set-valued functions
A stochastic approximation counterpart of the feasible direction method
Discussion on the convergence of Rosen's gradient projection method
Remarks on the convergence of Rosen's gradient projection method
Horizontal mixed decomposition
A convergence theorem of Rosen’s gradient projection method
The linearized version of an algorithm for the mixed norms problem
An efficient dual approach to the urban road network design problem
A distribution multi-echelon lot-size model
Bounding the inefficiency of Nash equilibria in games with finitely many players
Isosystolic inequalities for optical hypersurfaces
A block coordinate variable metric forward-backward algorithm
Applications of fuzzy set theory to mathematical programming
On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
Global convergence of Rosen's gradient projection method
Asymptotic theory for analyzing dose-response survival data with application to the low-dose extrapolation problem
Convex optimization approach to signals with fast varying instantaneous frequency
On the convergence of a class of outer approximation algorithms for convex programs
On the convergence of a class of nonlinear approximation methods
Global asymptotic stability of non-linear difference equations
MINIMAX SOLUTIONS IN STOCHASTIC PROGRAMMING
A fast polynomial time algorithm for logistics network flows
A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
Optimal consensus of fuzzy opinions under group decision making environment
A combinatorial approximation algorithm for supply chain network flow problem
Bounds for stochastic convex programs
Generalized Kuhn-Tucker conditions and duality for continuous nonlinear programming problems
Optimality conditions and duality in continuous programming. I: Convex programs and a theorem of the alternative
A procedure for new product positioning in an attribute space
Convergence properties of relaxation algorithms
Nadler's type principle with high order of convergence
Positive definite constrained least-squares estimation of matrices

This page was built for publication: Convergence Conditions for Nonlinear Programming Algorithms

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