scientific article; zbMATH DE number 4007605
From MaRDI portal
Publication:3757284
zbMATH Open0621.65061MaRDI QIDQ3757284FDOQ3757284
Authors: Ladislav Lukšan 
Publication date: 1986
Full work available at URL: https://eudml.org/doc/15462
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 3880447
- scientific article; zbMATH DE number 3874969
- A quadratic approximation method for minimizing a class of quasidifferentiable functions
- Quadratic Approximations in Convex Nondifferentiable Optimization
- A direct method of linearization for continuous minimax problems
Cites Work
- A numerically stable dual method for solving strictly convex quadratic programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Variable metric methods for minimizing a class of nondifferentiable functions
- Acceleration of the leastpth algorithm for minimax optimization with engineering applications
- Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
- Combined lp and quasi-Newton methods for minimax optimization
- Non-linear minimax optimization as a sequence of leastpth optimization with finite values ofp
- An Algorithm for Minimax Solution of Overdetermined Systems of Non-linear Equations
- Variable metric methods for linearly constrained nonlinear minimax approximation
Cited In (6)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Separating plane algorithms for convex optimization
- Title not available (Why is that?)
- Method of solving nonlinear programming using variable dimension basis.
- Duality bound method for the general quadratic programming problem with quadratic constraints
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 Q3757284)
