Publication:3277015
From MaRDI portal
zbMath0097.35408MaRDI QIDQ3277015
Publication date: 1960
Related Items
Optimal quantization of the support of a continuous multivariate distribution based on mutual information, Solving the minimax open-loop control problem for carrier rocket fuel consumption, A discussion of probability functions and constraints from a variational perspective, Nonlinear goal programming theory and practice: A survey, A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity, New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate, Modified combined relaxation method for general monotone equilibrium problems in Hilbert spaces, Analysis of equal-share and equalized flow distribution at the peak load in the multiuser network, Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints, A decomposition method for large-scale box constrained optimization, Optimal scheduling of reservoir releases during flood: Deterministic optimization problem. I: Procedure, Convergence analysis of norm-relaxed method of feasible directions, Generalization of Murty's direct algorithm to linear and convex quadratic programming, A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization, Pivoting in linear complementarity: Two polynomial-time cases, A new method for solving conditioned maxima problems, Self-tuning norm-relaxed method of feasible directions, Max-min resource allocation, An accurate method for real-time aircraft dynamics simulation based on predictor-corrector scheme, Local feasible QP-free algorithms for the constrained minimization of SC\(^1\) functions, Rate of convergence of the method of feasible directions, not necessarily using the direction of steepest descent, Sensitivity analysis of optimum solutions by updating active constraints: application in aircraft structural design, A conjugate Rosen's gradient projection method with global line search for piecewise linear concave optimization, Combinatorial characterizations of \(K\)-matrices, Finitely convergent \(\varepsilon\)-generalized projection algorithm for nonlinear systems, Partitioning procedures for solving mixed-variables programming problems, A geometrie representation for pairs of dual quadratic or linear programs, An efficient curvilinear method for the minimization of a nonlinear function subject to linear inequality constraints, Optimal elastic design of trusses by feasible direction methods, Observations on a class of nasty linear complementarity problems, Feasible direction method for large-scale nonconvex programs: Decomposition approach, Evaluating jointly constrained order quantity complexities for incremental discounts., Finding second-order stationary points in constrained minimization: a feasible direction approach, A globally convergent, implementable multiplier method with automatic penalty limitation, Distributed-parameter optimal control via mathematical programming, A cutting-plane algorithm with linear and geometric rates of convergence, Feasibility preserving constraint-handling strategies for real parameter evolutionary optimization, A revised particle swarm optimization based discrete Lagrange multipliers method for nonlinear programming problems, New convergence theorems for a class of feasible directions algorithms, An algorithm for linearly constrained nonlinear programming problems, Canonical bases in linear programming, A new solution to optimization-satisfaction problems by a penalty method, Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions, A new SQP method of feasible directions for nonlinear programming., Shape design sensitivity analysis with respect to the positioning of features in composite structures using the boundary element method, A new \(\varepsilon \)-generalized projection method of strongly sub-feasible directions for inequality constrained optimization, Numerical study of some feasible direction methods in mathematical programming, Method of reduction in convex programming, Parameter detection of thin films from their X-ray reflectivity by support vector machines., An efficient approach to updating simplex multipliers in the simplex algorithm, Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems, Scope of stationary multi-objective evolutionary optimization: a case study on a hydro-thermal power dispatch problem, On the convergence of the Pshenichnyi-Pironneau-Polak minimax algorithm with an active set strategy, Enumeration of PLCP-orientations of the 4-cube, Constructive characterization of Lipschitzian \(Q_ 0\)-matrices, Vertex assigned morphing for parameter free shape optimization of 3-dimensional solid structures, Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems, A sequential quadratically constrained quadratic programming method of feasible directions, An efficient sequential quadratic programming algorithm for nonlinear programming, Algorithm model for penalty functions-type iterative pcedures, A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity, Decentralized optimization for distributed-lag models of discrete systems, On the rate of convergence of some feasible direction algorithms, On the removal of ill conditioning effects in the computation of optimal controls, Mathematical model and efficient algorithms for object packing problem, A systematic approach to the synthesis of algorithms, A feasible interior-point algorithm for nonconvex nonlinear programming, A convergence theory for a class of anti-jamming strategies, A conjugate direction algorithm without line searches, Approximation methods for the unconstrained optimization, An accelerated conjugate direction method to solve linearly constrained minimization problems, Accelerated conjugate direction methods for unconstrained optimization, The steepest descent gravitational method for linear programming, Feasible directions in economic policy, Maximally stable lobed balloons, A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization, An algorithm for minimizing a differentiable function subject to box constraints and errors, Algorithmic equivalence in quadratic programming. I. A least-distance programming problem, A geometric method in nonlinear programming, A constrained optimization reformulation and a feasible descent direction method for \(L_{1/2}\) regularization, The Topkis-Veinott algorithm for solving nonlinear programs with lower and upper bounded variables, Algorithms for a class of computer-aided design problems: A review, Optimal packings for filled rings of circles., Algorithms for some minimax problems, An exact penalty function algorithm for optimal control problems with control and terminal equality constraints. I, On variable-metric algorithms, Computational methods for optimum design of large complex systems, Global convergence analysis of algorithms for finding feasible points in norm-relaxed MFD, Optimization over the efficient set of a parametric multiple objective linear programming problem, New reflection generator for simulated annealing in mixed-integer/continuous global optimization, A generalization of the norm-relaxed method of feasible directions, A feasible conjugate direction method to solve linearly constrained minimization problems, First-order strong variation algorithms for optimal control problems with terminal inequality constraints, An approximation-concepts approach to shape optimal design, Necessary and sufficient conditions for emptiness of the cones of generalized support vectors, Probabilistic version of the method of feasible directions., The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review, An interior feasible direction method with constraint projections for linear programming, Enhanced methods for feasible directions for engineering design problems, On the globalization of Wilson-type optimization methods by means of generalized reduced gradient methods, Indefinite cubic programming with standard errors in objective function, A least distance algorithm for a smooth strictly convex norm, A new trust region–sequential quadratic programming approach for nonlinear systems based on nonlinear model predictive control, Unconventional optimization for achieving well-informed design solutions for the automobile industry, Maximization of the transmission rate of a discrete, constant channel, Programming with a special class of nonlinear functionals, A hybrid method fur linearly constrained optimisation problems, Unnamed Item, Programming under uncertainty: The complete problem, A two-stage feasible directions algorithm for nonlinear constrained optimization, A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization, Constrained extremum seeking of a MIMO dynamic system, Penalty function versus non-penalty function methods for constrained nonlinear programming problems, Nota sobre programacion lineal estocastica: Evolucion y estado actual. (I), The method of feasible directions for minimax problems, An algorithm for non-negative norm minimal solutions, On the rate of convergence of certain methods of centers, A chance-constrained programming algorithm, An algorithm for solving linearly constrained optimization problems, A projective method for structured nonlinear programs, Problems and methods with multiple objective functions, Analysis of the load distribution and internodal flows under different routing strategies in a multiuser network, Estimate of resource distribution with the shortest paths in the multiuser network, Newton-type methods for unconstrained and linearly constrained optimization, A combined method for smooth equilibrium problems with nonlinear constraints, A note on maximization of the transmission rate of discrete, constant channel, Unnamed Item, Unnamed Item, Optimization algorithms and point-to-set-maps, Unnamed Item, Ein lineares Programmierungsverfahren, Gradient and gravity center method in linear and nonlinear optimization, Minimaxprobleme und nichtlineare Optimierung, Convergence bounds for nonlinear programming algorithms, Optimally conditioned optimization algorithms without line searches, Nonsmooth Optimization, Feasible directions algorithms for optimization problems with equality and inequality constraints, A method to accelerate the rate of convergence of a class of optimization algorithms, A superlinearly convergent method of feasible directions., Rational approximation of empirical functions, A quadratic programming method with error estimates for approximate solutions, Ein Verfahren zur Lösung parameterabhängiger, nichtlinearer Maximum-Probleme, Contributions to the theory of stochastic programming, An algorithm for constrained convex optimization, On pricing and backward transformation in linear programming, Characterizations of optimality in convex programming: the nondifferentiable case, Convergence properties of relaxation algorithms, Approximation of reachable sets by direct solution methods for optimal control problems, Extension of a hybrid genetic algorithm for nonlinear programming problems with equality and inequality constraints., Supervised Learning by Support Vector Machines, Combined relaxation method for monotone equilibrium problems, Characterizations of optimality in convex programming: the nondifferentiable case, Geometry of optimality conditions and constraint qualifications: The convex case, Unnamed Item, Variation der Rechnungsgrundlagen bei der Berechnung von Kennzahlen eines Lebensversicherungsbestandes, Approximation operators in optimization theory, An interior point method for nonlinear programming, Approximate solution of parametric integer programming problems, Structural weight minimization using necessary and sufficient conditions, On differentiability properties of player convex generalized Nash equilibrium problems, Some representation theorems for functions and sets and their application to nonlinear programming, On error bounds of approximate solutions by means of variational methods and duality theory, Sur quelques méthodes de gradient réduit sous contraintes linéaires, Projection method for unconstrained optimization, Cutting plane algorithms and state space constrained linear optimal control problems, A method of feasible directions using function approximations, with applications to min max problems, A modified gradient method for finite element elastoplastic analysis by quadratic programming, Optimizing functional in combined controls of dynamic plants, Optimization of Space Station components using design code CometBoards, A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization, Null space gradient flows for constrained optimization with applications to shape optimization, A method for solving maximum-problems with a nonconcave quadratic objective function, Beiträge zur Dekomposition von linearen Programmen, A non-linear programming approach to the computer-aided design of regulators using a linear-quadratic formulation†, Zum heutigen Stand der nichtlinearen Optimierungstheorie, An extension of the frank and Wolfe method of feasible directions, Das zweistufige Problem der stochastischen linearen Programmierung, A Class of Accelerated Conjugate Direction Methods for Linearly Constrained Minimization Problems, Verfahren der zulässigen riehtungeh unter rexmtzung reduzierter gradienten für niehtllneare optimierungsprobleme, Dual finite element analysis for unilateral boundary value problems
