scientific article; zbMATH DE number 3466802
From MaRDI portal
Publication:4051876
Cited in
(only showing first 100 items - show all)- A simple and elementary proof of the Karush-Kuhn-Tucker theorem for inequality-constrained optimization
- An inverse algorithm for the identification and the sensitivity analysis of the parameters governing micropolar elasto-plastic granular material
- Solving the incomplete market model with aggregate uncertainty using a perturbation method
- A general convergence theorem for the reduced gradient method
- On the characterization of noninferior solutions of the vector optimization problem
- A survey of preconditioned iterative methods for linear systems of algebraic equations
- Analysis of covariance and correlation structures
- Iterative methods for overflow queueing models. I
- Constrained interpolation and smoothing
- A Gauss-Newton algorithm for exploratory factor analysis
- An analysis of Monte Carlo algorithms for counting problems
- Distributed algorithms for the computation of noncooperative equilibria
- Dual techniques for constrained optimization
- A note on a globally convergent Newton method for solving monotone variational inequalities
- Eigenfunction methods and nonlinear hyperbolic boundary value problems at resonance
- Identification and application of bounded-parameter models
- An output error model and algorithm for electromagnetic system identification
- Convergence of relaxation algorithms by averaging
- Proof of global convergence of an efficient algorithm for predicting trip generation, trip distribution, modal split and traffic assignment simultaneously on large-scale networks
- New approach for nonseparable dynamic programming problems
- Application of Lagrangian relaxation to computer network control
- Fault diagnosis under a limited-fault assumption and limited test-point availability
- Dynamic programming, reduction of dimensionality and eigenvalue problems
- Analysis of a class of fractional programming problems
- Stepsize analysis for descent methods
- A conjugate directions method for subjective assessment of normal distributions
- On the spectrum of a nonsingular matrix
- A minimization method for the sum of a convex function and a continuously differentiable function
- The Lanczos phenomenon - An interpretation based upon conjugate gradient optimization
- On the convergence of the conjugate gradient method for singular capacitance matrix equations from the Neumann problem of the Poisson equation
- A property of certain multistage linear programs and some applications
- Algorithms for a class of nondifferentiable problems
- Nonstationary Markov decision problems with converging parameters
- State inverse and decorrelated state stochastic approximation
- Feasible direction method for large-scale nonconvex programs: Decomposition approach
- Piecewise linear optimization
- Geometric programming. Method and applications
- A cutting-plane algorithm with linear and geometric rates of convergence
- Optimal location on a sphere
- Minimization by coordinate descent
- Cluster validity for fuzzy clustering algorithms
- Perspectives on self-scaling variable metric algorithms
- Minimizing a differentiable function over a differential manifold
- A generalized conjugate gradient algorithm for solving a class of quadratic programming problems
- A modified Newton's method for minimizing factorable functions
- Minimal representation of convex polyhedral sets
- A computational method for the indefinite quadratic programming problem
- Model algorithmic control (MAC); basic theoretical properties
- Stochastic adaptive control using a modified least squares algorithm
- Scaling nonlinear programs
- Decomposition methods in multiobjective discrete-time dynamic problems
- Convergence rate analysis of the state increment dynamic programming method
- Periodically preconditioned conjugate gradient-restoration algorithm
- Signal enhancement and the method of successive projections
- Complexity analysis of a linear complementarity algorithm based on a Lyapunov function
- A step size rule for unconstrained optimization
- Minimization of ratios
- Parametric optimal design
- On quasi-Newton and pseudo-Newton algorithms
- On the rate of convergence of some feasible direction algorithms
- On the Pironneau-Polak method of centers
- Bayesian estimation in unrestricted factor analysis: A treatment for Heywood cases
- A rank-one algorithm for unconstrained function minimization
- On a characterization of convergence for the Hestenes method of multipliers
- Numerische Methoden zur Behandlung einiger Problemklassen der nichtlinearen Tschebyscheff-Approximation mit Nebenbedingungen
- Diagonalized multiplier methods and quasi-Newton methods for constrained optimization
- Sufficient conditions for the convergence of monotonic mathematical programming algorithms
- Real-time failure detection: A nonlinear optimization problem that yields a two-ellipsoid overlap test
- Approximation procedures based on the method of multipliers
- Optimality conditions in generalized geometric programming
- Projection and restriction methods in geometric programming and related problems
- A modified reduced gradient method for dual posynomial programming
- Distributed computing viewed as a team problem with constraints
- Optimal impulsive control of compartment models. II: Algorithm
- Rates of convergence of a one-dimensional search based on interpolating polynomials
- A second-order method for the general nonlinear programming problem
- A second-order method for unconstrained optimization
- An iterative procedure for collapse analysis of reinforced concrete plates
- Convexification procedures and decomposition methods for nonconvex optimization problems
- Properties of updating methods for the multipliers in augmented Lagrangians
- Biconjugate directions
- Extrema constrained by a family of curves and local extrema
- Theorems of the alternative and optimality conditions for convexlike and general convexlike programming
- H-symmetric optimal repeated measurements designs
- On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program
- Optimal consumption and arbitrage in incomplete, finite state security markets
- On the rate of convergence of two minimax algorithms
- Descent methods for convex essentially smooth minimization
- On the convergence of the coordinate descent method for convex differentiable minimization
- Measuring rates of convergence of numerical algorithms
- Extended convergence results for the method of multipliers for nonstrictly binding inequality constraints
- Analysis and implementation of a dual algorithm for constrained optimization
- Optimal \({\mathcal H}_ \infty\)-state feedback control for continuous-time linear systems
- Conjugate residual methods for almost symmetric linear systems
- A new method for a class of linear variational inequalities
- Explicit conjugate gradient method with preconditioning
- Single machine scheduling with start time dependent processing times: Some solvable cases
- Stable barrier-projection and barrier-Newton methods in linear programming
- Preconditioning of conjugate gradients by multigrid solver
- Robust stability of polynomials: New approach
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4051876)
