Convergence Conditions for Nonlinear Programming Algorithms
From MaRDI portal
Publication:5585897
Cited in
(only showing first 100 items - show all)- A unified approach to the feasible direction methods for nonlinear programming with linear constraints
- Applications of fuzzy set theory to mathematical programming
- Extensions of Radstrom's lemma with application to stability theory of mathematical programming
- A computable convex programming characterization of optimal interpolatory quadratic splines with free knots
- Local convergence of the fuzzy c-means algorithms
- Combinatorial behavior of extreme points of perturbed polyhedra
- Approximate conversion of spline curves
- Convergence of relaxation algorithms by averaging
- A stochastic approximation counterpart of the feasible direction method
- A shadow price in integer programming for management decision
- On the convergence of reference point methods in multiobjective programming
- Interval Newton methods and perturbed problems
- 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
- Asymptotic theory for analyzing dose-response survival data with application to the low-dose extrapolation problem
- Generalized Kuhn-Tucker conditions and duality for continuous nonlinear programming problems
- Nonlinear programming with cumulatively bounded variables
- Optimality conditions and duality in continuous programming. I: Convex programs and a theorem of the alternative
- Optimal cargo allocation on board a plane: A sequential linear programming approach
- On the convergence of a class of nonlinear approximation methods
- Using efficient feasible directions in interactive multiple objective linear programming
- A method for approximating the solution set of a system of convex inequalities by polytopes
- Approximation in multiobjective optimization
- The multi-dimensional von Neumann alternating direction search algorithm in \(C(B)\) and \(L_1\)
- A distribution multi-echelon lot-size model
- An algorithm for linearly constrained programs with a partly linear objective function
- On subsidiary problems in geometric programming
- Algorithm model for penalty functions-type iterative pcedures
- Inelastic analysis of suspension structures by nonlinear programming
- A dual formulation for generating information about constrained optima in automated design
- Stochastic approximation of constrained systems with system and constraint noise
- A generalization of Lagrange's method of undetermined multipliers using zero-zone functionals
- A canonical structure for iterative procedures
- Trader-commodity parity theorems
- Sufficient conditions for the convergence of monotonic mathematical programming algorithms
- Low-dose-rate extrapolation of data from animal carcinogenicity experiments. - Analysis of a new statistical technique
- A procedure for new product positioning in an attribute space
- A review of techniques for automated structural design
- Maximization of linearly constrained posynomials
- An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality
- Large-scale problem analysis and decomposition theory
- An efficient dual approach to the urban road network design problem
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
- The Topkis-Veinott algorithm for solving nonlinear programs with lower and upper bounded variables
- An exact penalty function algorithm for solving general constrained parameter optimization problems
- Some notes on the time-variant Lyapunov theory
- Global and variable cost manufacturing systems
- Modified descent methods for solving the monotone variational inequality problem
- Adjustment process-based approach for computing a Nash-Cournot equilibrium
- Implied constraints and a unified theory of duality in linear and nonlinear programming
- A unified description of iterative algorithms for traffic equilibria
- Eigenvector saddlepoints and zero properties of the eigenpolynomial factors
- Finite sample moments results for the quasi-FIML estimator of the reduced form: The linear case
- Lagrangian duality for preinvex set-valued functions
- A new approach to stochastic programming problems: Discrete model
- Convergence behavior of an iterative reweighting algorithm to compute multivariate M-estimates for location and scatter
- The unilateral frictionless contact of a piezoelectric body with a rigid support.
- A general algorithm for obtaining simple structure of core arrays in \(N\)-way PCA with application to fluorometric data
- A nontangential cutting plane algorithm
- A model for elastic-viscoplastic deformations of crystalline solids based on material symmetry: theory and plane-strain simulations
- A conversation with Jeff Wu
- Global convergence of Rosen's gradient projection method
- Optimal consensus of fuzzy opinions under group decision making environment
- Positive definite constrained least-squares estimation of matrices
- Bi-criteria fuzzy \(c\)-means analysis
- Nonparametric estimation and consistency for renewal processes
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- ROS regression: integrating regularization with optimal scaling regression
- Nadler's type principle with high order of convergence
- A Tikhonov regularized penalty function approach for solving polylinear programming problems
- Convex optimization approach to signals with fast varying instantaneous frequency
- A survey on the continuous nonlinear resource allocation problem
- Biconvex sets and optimization with biconvex functions: a survey and extensions
- Bounding the inefficiency of Nash equilibria in games with finitely many players
- A convergence theorem for the fuzzy subspace clustering (FSC) algorithm
- The restricted EM algorithm under inequality restrictions on the parameters
- A heuristic algorithm for network equilibration
- Nonnegative matrix factorization and I-divergence alternating minimization
- A variable structure convex programming based control approach for a class of uncertain linear systems
- Nonsmooth semi-infinite programming problems with mixed constraints
- Numerical computational methods of optimisation in control
- A decomposition algorithm for solving a class of optimal control problems
- The application of generalized Benders decomposition to certain nonconcave programs
- Continuousization of the family of point-to-set maps and its applications
- A convergence theorem of Rosen’s gradient projection method
- Isosystolic inequalities for optical hypersurfaces
- An algorithm for constrained convex optimization
- stochastic quasigradient methods and their application to system optimization†
- Distributed asynchronous computation of fixed points
- Vector maximisation and lagrange multipliers
- Necessary and sufficient conditions for convergence of iteration algorithms of nonlinear programming
- Alternating projections on nontangential manifolds
- Fixed Points and Stationary Points of Dissipative Multivalued Maps
- MINIMAX SOLUTIONS IN STOCHASTIC PROGRAMMING
- Heuristische Lösungsverfahren Versuch einer Begriffsklärung
- Explicit duality for convex homogeneous programs
- Linear Chebyshev Approximation of Complex-Valued Functions
- Some remarks on condensation methods for geometric programs
- Generalized second-order derivatives and optimality conditions
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)