Acceleration of the leastpth algorithm for minimax optimization with engineering applications

DOI10.1007/BF01588251zbMath0418.90072OpenAlexW1992499818MaRDI QIDQ3851986

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

zbMATH Keywords

minimax optimizationnonlinear programmingunconstrained minimizationnondifferentiable optimizationlocal convergenceengineering applicationscomputer-aided circuit designdigital filter designdifferentiable objective functionsapplication of nonlinear programminggroup delay approximation designHestenes- Powell augmented Lagrangian methodleast pth optimizationtransmission-line transformer design

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonlinear programming (90C30) Numerical methods involving duality (49M29) Existence of solutions for minimax problems (49J35)

Related Items (20)

A nonlinear Lagrangian based on Fischer-Burmeister NCP function ⋮ A Nonlinear Lagrange Algorithm for Minimax Problems with General Constraints ⋮ Perturbing the dual feasible region for solving convex quadratic programs ⋮ Algorithms with adaptive smoothing for finite minimax problems ⋮ Unification of basic and composite nondifferentiable optimization ⋮ A nonlinear augmented Lagrangian for constrained minimax problems ⋮ Discrete minimax problem: Algorithms and numerical comparisons ⋮ An implementable SAA nonlinear Lagrange algorithm for constrained minimax stochastic optimization problems ⋮ A spline smoothing Newton method for finite minimax problems ⋮ A smooth method for the finite minimax problem ⋮ Further study on a dual algorithm ⋮ A dual algorithm for minimax problems ⋮ A truncated aggregate smoothing Newton method for minimax problems ⋮ Optimization of electrical circuits ⋮ Improved dual algorithm for constrained optimization problems ⋮ Unnamed Item ⋮ Yield design theory: An efficient static method formulation ⋮ An active set smoothing method for solving unconstrained minimax problems ⋮ An Adaptive Smoothing Method for Continuous Minimax Problems ⋮ Error bounds of two smoothing approximations for semi-infinite minimax problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multiplier and gradient methods
• 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
• Nonlinear leastpth optimization and nonlinear programming
• An Efficient Method to Solve the Minimax Problem Directly
• A dual approach to solving nonlinear programming problems by unconstrained optimization
• Non-Linear Programming Via Penalty Functions
• A new approach to variable metric algorithms
• A computational comparison of some non-linear programs

This page was built for publication: Acceleration of the leastpth algorithm for minimax optimization with engineering applications