scientific article; zbMATH DE number 3310599
From MaRDI portal
zbMath0195.20804MaRDI QIDQ5591247
Publication date: 1969
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Constraint qualifications in the invex case, New coordination strategy for on-line hierarchical optimizing control of large scale industrial processes, A Tikhonov regularization parameter approach for solving Lagrange constrained optimization problems, A Scalable Empirical Bayes Approach to Variable Selection in Generalized Linear Models, Unnamed Item, A continuous-time Markov Stackelberg security game approach for reasoning about real patrol strategies, A differential dynamic programming algorithm for differential games, An iterative solution method for systems of nonlinear equations on a parallelepiped, Constraint qualifications in nonsmooth optimization: Classification and inter-relations, Unnamed Item, A New Boosted Proximal Point Algorithm for Minimizing Nonsmooth DC Functions, A geometric motion planning for a spin-rolling sphere on a plane, Spectral clustering with robust self-learning constraints, Iterative algorithms for a non-linear inverse problem in atmospheric lidar, Maximum approximate likelihood estimation in accelerated failure time model for interval‐censored data, Directional shadow price in linearly constrained nonconvex optimization models, Merits and limitations of optimality criteria method for structural optimization, An efficient algorithm for minimizing barrier and penalty functions, Minimizing sequences in a constrained DC optimization problem, Unnamed Item, Direct algorithms in quadratic programming, On the application of deterministic and stochastic programming methods to problems of economics;Mathematische Programmierung und ihre Anwendung auf die Wirtschaft, Brève communication. Décomposition en programmation convexe, Optimization algorithms and point-to-set-maps, A new algorithm for the solution of multi-state dynamic programming problems, Learning automata in feedforward connectionist systems, Silving Linear Programs With Inequality Constraints Via Perturbation of Feasible Region, Unnamed Item, An extension of Curry's theorem to steepest descent in normed linear spaces, A central cutting plane algorithm for the convex programming problem, Identifiability analysis of interconnected zero-memory composite systems, A finite algorithm to maximize certain pseudoconcave functions on polytopes, Fractional programming, Convergence bounds for nonlinear programming algorithms, A minimum-cost multicommodity network flow problem concerning imports and exports, Inexact primal–dual gradient projection methods for nonlinear optimization on convex set, On properties of the iterative maximum likelihood reconstruction method, Robust integral sliding mode controller for optimisation of measurable cost functions with constraints, Optimality conditions for maximizations of set-valued functions, Approximate cutting planes in nonlinear programming, Optimality conditions for maximizations of set-valued functions, Stochastic programming in production planning: a case with none-simple recourse, Simplicial decomposition in nonlinear programming algorithms, Optimisation connexe en dimension finie par relaxation, Charakterisierung dynamischer leontief- systeme bei unbestimmten koeffizientenmatrizen, Convergence properties of relaxation algorithms, Computational aspects of cutting-plane algorithms for geometric programming problems, On EM algorithms and their proximal generalizations, On the Fermat—Weber problem with convex cost functions, Convergence properties of the EM algorithm in constrained parameter spaces, A convergent composite mapping Fourier domain iterative algorithms for 3-D discrete tomography, Perturbation des méthodes d'optimisation. Applications, Conditions de convergence pour les algorithmes itératifs monotones, autonomes et non déterministes, A property of continuous unbounded algorithms, Feasible direction methods for stochastic programming problems, Shadow prices in nonconvex mathematical programming, On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods, Optimality condition: Constraint regularization, Constructing Mixed Algorithms on the Basis of Some Bundle Method, Lagrangian duality for a class of infinite programming problems, Sur quelques méthodes de gradient réduit sous contraintes linéaires, Orthogonal Trace-Sum Maximization: Applications, Local Algorithms, and Global Optimality, Equilibrium programming:The path following approach and dynamics, Unnamed Item, Extension of optimality conditions via supporting functions, Unnamed Item, Iteration grain sized asynchronous parallel algorithms in optimization, Geometry of optimality conditions and constraint qualifications, Existence and Lagrangian duality for maximization of set-valued functions, Global convergence and rate of convergence of a method of centers, Local convergence analysis of a grouped variable version of coordinate descent, Cutting-plane method based on epigraph approximation with discarding the cutting planes, Solving generalized goal programming problems using a visual interactive approach, On the maximum penalized likelihood approach for proportional hazard models with right censored survival data, A constant rank constraint qualification in continuous-time nonlinear programming, Proximal point algorithms for multi-criteria optimization with the difference of convex objective functions, A forward convex-simplex method, Fuzzy c-means: optimality of solutions and effective termination of the algorithm, Optimality functions and lopsided convergence, Isosystolic inequalities for optical hypersurfaces, Smooth sparse coding via marginal regression for learning sparse representations, A stochastic algorithm using one sample point per iteration and diminishing step-sizes, Perturbed steepest-descent technique in multiextremal problems, Proof of global convergence of an efficient algorithm for predicting trip generation, trip distribution, modal split and traffic assignment simultaneously on large-scale networks, The equal flow problem, Perturbing the dual feasible region for solving convex quadratic programs, Maximum-entropy clustering algorithm and its global convergence analysis, Max-min resource allocation, Upper-semi-continuity and cone-concavity of multi-valued vector functions in a duality theory for vector optimization, Minimizing pseudoconvex functions on convex compact sets, Sur la convergence théorique de la méthode du gradient reduit généralise, Designing cutouts for optimum residual strength in plane structural elements, Convergence analysis of perturbed feasible descent methods, Penalty function approach to linear trilevel programming, Duality in improper programming, Column generation algorithms for nonlinear optimization. II: Numerical investigations, A minimization method for the sum of a convex function and a continuously differentiable function, Proximal alternating linearized minimization for nonconvex and nonsmooth problems, Multi-path utility maximization and multi-path TCP design, SpicyMKL: a fast algorithm for multiple kernel learning with thousands of kernels, A majorization-minimization approach to the sparse generalized eigenvalue problem, A cutting-plane algorithm with linear and geometric rates of convergence, Indirect density estimation using the iterative Bayes algorithm, A maximization method for a class of quasiconcave programs, Double indices-induced FCM clustering and its integration with fuzzy subspace clustering, On some methods for entropy maximization and matrix scaling, Mathematical theory of optimal control, A review of the optimal power flow, Stochastic programming: An interactive multicriteria approach, Approximate solutions to large scale capacitated facility location problems, Global convergence of modified multiplicative updates for nonnegative matrix factorization, The \(K\)-INDSCAL model for heterogeneous three-way dissimilarity data, Descent method for monotone mixed variational inequalities, Signal enhancement and the method of successive projections, Guaranteeing approach to solving quantile optimization problems, Cyclic coordinate descent in hydrothermal nonsmooth problems, Fitting semiparametric clustering models to dissimilarity data, Cyclic coordinate descent in a class of bang-singular-bang problems, The Lagrange method for the regularization of discrete ill-posed problems, Second-order optimality conditions for vector problems with continuously Fréchet differentiable data and second-order constraint qualifications, Fuzzy partition based soft subspace clustering and its applications in high dimensional data, Optimal control problem regularization for the Markov process with finite number of states and constraints, The \(K\)-coverage concentrator location problem, Subspace clustering by \((k,k)\)-sparse matrix factorization, Fitting longitudinal reduced-rank regression models by alternating least squares, Stability theorems for infinitely constrained mathematical programs, Limited role of entropy in information economics, Rates of convergence for a method of centers algorithm, Linear programming techniques for multidimensional analysis of preferences, Multiplier methods: A survey, A systematic approach to the synthesis of algorithms, Generalized Lagrange multiplier technique for nonlinear programming, One-at-a-time dynamic programming over polytope, Generalized reduced gradient method as an extension of feasible direction methods, On functions whose stationary points are global minima, Discrete, non-linear approximation problems in polyhedral norms, Remarks on the convergence of Rosen's gradient projection method, Discussion on the convergence of Rosen's gradient projection method, The method of successive orthogonal projections for solving nonlinear simultaneous equations, Optimizing the location of a production firm, Comparison of generalized geometric programming algorithms, Transcendental geometric programs, A comparison of computational strategies for geometric programs, Numerical solution of nonlinear elliptic partial differential equations by a generalized conjugate gradient method, Implementation of gradient methods by tangential discretization, An application of the algorithm of the cyclic coordinate descent in multidimensional optimization problems with constrained speed, Joint variable and rank selection for parsimonious estimation of high-dimensional matrices, Algorithmes pour suites non convergentes, Stochastic algorithms with Armijo stepsizes for minimization of functions, A cutting-plane method without inclusions of approximating sets for conditional minimization, Benders decomposition for variational inequalities, Error stability properties of generalized gradient-type algorithms, Use of stochastic and mathematical programming in portfolio theory and practice, Improved steplength by more practical information in the extragradient method for monotone variational inequalities, A constrained nonlinear 0-1 program for data allocation, New reflection generator for simulated annealing in mixed-integer/continuous global optimization, A least squares algorithm for a mixture model for compositional data., A note on the location of an obnoxious facility on a network, A displacement formulation for the finite element elastic-plastic problem, An overall study of convergence conditions for algorithms in nonlinear programming, A visual interactive method for solving the multiple criteria problem, Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results, Another interpretation of the EM algorithm for mixture distributions, Some notions of nonstationary multistep iteration processes, Descent methods for convex essentially smooth minimization, On the convergence of the coordinate descent method for convex differentiable minimization, Asymptotic properties of the Fenchel dual functional and applications to decomposition problems, Smooth positive extensions and nonlinear programming, Variations and extension of the convex-concave procedure, Global optimization on an interval, Convergence properties of the generalized fuzzy c-means clustering algorithms, Optimisation impossible, A study of mathematical programming methods for structural optimization. Part I: Theory, On hidden Markov models and cyclic strings for shape recognition, Second-order disjoint factor analysis, Alternating Minimization Algorithm with Automatic Relevance Determination for Transmission Tomography under Poisson Noise, Descent methods for a class of generalized variational inequalities, Some comments on Wolfe's ‘away step’, Finite method for a nonlinear allocation problem, Proximal Proper Saddle Points in Set-Valued Optimization, Probability-theoretical generalization of the second Lyapunov method, The majorization approach to multidimensional scaling for Minkowski distances, Smoothed penalty algorithms for optimization of nonlinear models, A Proof of Convergence of the Concave-Convex Procedure Using Zangwill's Theory, Iterative processes: A survey of convergence theory using Lyapunov second method, Maxmin subject to marginal constraints, Constructing the Pareto front for multi-objective Markov chains handling a strong Pareto policy approach, Using geometric arithmetic mean to solve non-linear fractional programming problems, A convergence theorem for graph shift-type algorithms, Inadaptation theorems in the dynamics of elastic-work hardening structures, A feasible direction method for image restoration, Unnamed Item, Disjoint factor analysis with cross-loadings, The blockwise coordinate descent method for integer programs, Hierarchical means clustering, Continuous-time gradient-like descent algorithm for constrained convex unknown functions: penalty method application, Finding second-order stationary points in constrained minimization: a feasible direction approach, Sparse Kalman filtering approaches to realized covariance estimation from high frequency financial data, Two-stage scheme for global identification of interconnected steady-state systems, Discrete processes and their continuous limits, On convergence properties of implicit self-paced objective, Feature-weighted clustering with inner product induced norm based dissimilarity measures: an optimization perspective, Constrained fuzzy evidential multivariate model identified by EM algorithm: a soft sensor to monitoring imprecise and uncertain process parameters, Majorization-minimization algorithms for nonsmoothly penalized objective functions, An efficient implementation of the “partan” variant of the linear approximation method for the network equilibrium problem, Living on the edge: how risky is it to operate at the limit of the tolerated risk?, An improved general extra-gradient method with refined step size for nonlinear monotone variational inequalities, A Primer on Plasticity, A stable one-step-ahead predictive control of nonlinear systems, Product selection, machine time allocation, and scheduling decisions for manufacturing perishable products subject to a deadline, Unnamed Item, Games and cost of change, Bias-correction fuzzy clustering algorithms, Projected Gustafson-Kessel Clustering Algorithm and Its Convergence, Nonsmooth Optimization, The continuous multiple-modular design problem, The duality of option investment strategies for hedge funds, Approximate saddle points for minmax problems and vector valued games., Characterization of maximum likelihood solutions to image reconstruction in photon emission tomography, Three-mode component analysis with crisp or fuzzy partition of units, Optimal control of counter-terrorism tactics, A cutting method for finding discrete minimax with dropping of cutting planes, ADMM-EM method for \(L_1\)-norm regularized weighted least squares PET reconstruction, A combined penalty function and gradient projection method for nonlinear programming, A modified convace simplex algorithm for geometric programming, Equivalence of some quadratic programming algorithms, A new mathematical approach for handling DVH criteria in IMRT planning, Convergence of fuzzy-pyramid algorithms, Proximal point algorithms for vector DC programming with applications to probabilistic lot sizing with service levels, Approximation of nonnegative systems by moving averages of fixed order, Sparse mean-variance customer Markowitz portfolio optimization for Markov chains: a Tikhonov's regularization penalty approach, Necessary and sufficient conditions for (weakly) efficient of non-differentiable multi-objective semi-infinite programming problems, Optimizing cluster structures with inner product induced norm based dissimilarity measures: theoretical development and convergence analysis, A unified global convergence analysis of multiplicative update rules for nonnegative matrix factorization, On the local convergence of the Douglas-Rachford algorithm, A general solution to least squares problems with box constraints and its applications, On the convergence of some possibilistic clustering algorithms, On the unification of possibilistic fuzzy clustering: axiomatic development and convergence analysis, A generalized projective reconstruction theorem and depth constraints for projective factorization, Piecewise convexity of artificial neural networks, Axiomatic generalization of the membership degree weighting function for fuzzy \(C\) means clustering: theoretical development and convergence analysis, A trial-and-error congestion pricing method for day-to-day dynamic network flows considering travelers' heterogeneous inertia patterns, On multilevel iterative methods for optimization problems, Mid-term bio-economic optimization of multi-species fisheries, Lagrangian multipliers for generalized affine and generalized convex vector optimization problems of set-valued maps, Two fast vector-wise update algorithms for orthogonal nonnegative matrix factorization with sparsity constraint, Geometric programming with signomials, Unnamed Item, On cutoff optimization methods in infinite-dimensional spaces and applications, On sensitivity in optimal control problems, Convergence properties of local solutions of sequences of mathematical programming problems in general spaces, Maximum Likelihood Estimation in Gaussian Chain Graph Models under the Alternative Markov Property, Nonlinear programming using minimax techniques, Optimization of design tolerances using nonlinear programming, Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem, The regularized feasible directions method for nonconvex optimization, Stochastic proximal-gradient algorithms for penalized mixed models, The average shadow price for MILPs with integral resource availability and its relationship to the marginal unit shadow price, On functions whose local minima are global, Gaussian mixture model with an extended ultrametric covariance structure, A novel update rule of HALS algorithm for nonnegative matrix factorization and Zangwill's global convergence, A two-stage cutting-plane method for conditional minimizing function, On the bias in estimating genetic length and other quantities in simplex constrained models, The frequency assignment problem: A solution via nonlinear programming, Suppressed robust picture fuzzy clustering for image segmentation, Solving the cost to go with time penalization using the Lagrange optimization approach, Queueing-location problems on the plane, Optimality conditions for nonsmooth semidefinite programming via convexificators
