scientific article; zbMATH DE number 3310599
From MaRDI portal
Publication:5591247
zbMath0195.20804MaRDI QIDQ5591247
Publication date: 1969
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
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 ⋮ Robust semisupervised kernelized fuzzy local information C-means clustering for image segmentation ⋮ Parsimonious ultrametric Gaussian mixture models ⋮ Communication-efficient distributed statistical inference on zero-inflated Poisson models ⋮ Alternating minimization algorithm with a probability generating function-based distance measure ⋮ Via order markets towards price-taking equilibrium ⋮ The geometry of monotone operator splitting methods ⋮ 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 ⋮ Maximum approximate Bernstein likelihood estimation in proportional hazard model for interval-censored data ⋮ Optimality condition: Constraint regularization ⋮ A unified Bregman alternating minimization algorithm for generalized DC programs with application to imaging ⋮ 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
This page was built for publication:
