Acceleration of the leastpth algorithm for minimax optimization with engineering applications
DOI10.1007/BF01588251zbMATH Open0418.90072OpenAlexW1992499818MaRDI QIDQ3851986FDOQ3851986
Authors: Christakis Charalambous 
Publication date: 1979
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01588251
nonlinear programminglocal convergencenondifferentiable optimizationunconstrained minimizationminimax optimizationengineering applicationscomputer-aided circuit designdigital filter designdifferentiable objective functionsapplication of nonlinear programminggroup delay approximation designHestenes- Powell augmented Lagrangian methodleast pth optimizationtransmission-line transformer design
Applications of mathematical programming (90C90) Nonlinear programming (90C30) Numerical methods involving duality (49M29) Existence of solutions for minimax problems (49J35)
Cites Work
- Title not available (Why is that?)
- A new approach to variable metric algorithms
- Multiplier and gradient methods
- Title not available (Why is that?)
- Non-Linear Programming Via Penalty Functions
- A dual approach to solving nonlinear programming problems by unconstrained optimization
- Title not available (Why is that?)
- An Efficient Method to Solve the Minimax Problem Directly
- A computational comparison of some non-linear programs
- Nonlinear leastpth optimization and nonlinear programming
- Nonlinear programming using minimax techniques
- 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
- Title not available (Why is that?)
Cited In (20)
- A dual algorithm for minimax problems
- Algorithms with adaptive smoothing for finite minimax problems
- Optimization of electrical circuits
- Yield design theory: An efficient static method formulation
- Further study on a dual algorithm
- Unification of basic and composite nondifferentiable optimization
- Discrete minimax problem: Algorithms and numerical comparisons
- Title not available (Why is that?)
- An adaptive smoothing method for continuous minimax problems
- An active set smoothing method for solving unconstrained minimax problems
- A nonlinear Lagrangian based on Fischer-Burmeister NCP function
- An implementable SAA nonlinear Lagrange algorithm for constrained minimax stochastic optimization problems
- Improved dual algorithm for constrained optimization problems
- A smooth method for the finite minimax problem
- Error bounds of two smoothing approximations for semi-infinite minimax problems
- A Nonlinear Lagrange Algorithm for Minimax Problems with General Constraints
- A truncated aggregate smoothing Newton method for minimax problems
- Perturbing the dual feasible region for solving convex quadratic programs
- A nonlinear augmented Lagrangian for constrained minimax problems
- A spline smoothing Newton method for finite minimax problems
This page was built for publication: Acceleration of the leastpth algorithm for minimax optimization with engineering applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3851986)
